Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Ratsaby, Joel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A probabilistic approach to case-based inference
Martin Anthony
,
Joel Ratsaby
Theoretical Computer Science
589
, 2015, pp. 61-75
Learning bounds via sample width for classifiers on finite metric spaces
Martin Anthony
,
Joel Ratsaby
Theoretical Computer Science
529
, 2014, pp. 2-10
Maximal width learning of binary functions
Martin Anthony
,
Joel Ratsaby
Theoretical Computer Science
411
(1), 2010, pp. 138-147
On the combinatorial representation of information
Joel Ratsaby
Lecture Notes in Computer Science
4112
, 2006, pp. 479-488
Complexity of hyperconcepts
Joel Ratsaby
Theoretical Computer Science
363
(1), 2006, pp. 2-10
A constrained version of Sauer's lemma
Joel Ratsaby
Trends in Mathematics
, 2004, pp. 543-551
On the complexity of samples for learning
Joel Ratsaby
Lecture Notes in Computer Science
3106
, 2004, pp. 198-209
On learning multicategory classification with sample queries
Joel Ratsaby
Information and Computation
185
(2), 2003, pp. 298-327
On the learnability of rich function classes
Joel Ratsaby
,
Vitaly Maiorov
Journal of Computer and System Sciences
58
(1), 1999, pp. 183-192
The degree of approximation of sets in Euclidean space using sets with bounded Vapnik-Chervonenkis dimension
Vitaly Maiorov
,
Joel Ratsaby
Discrete Applied Mathematics
86
(1), 1998, pp. 81-93
On the value of partial information for learning from examples
Joel Ratsaby
,
Vitaly Maiorov
Journal of Complexity
13
(4), 1997, pp. 509-544