Communications of the ACM
A general lower bound on the number of examples needed for learning
Information and Computation
COLT '89 Proceedings of the second annual workshop on Computational learning theory
A training algorithm for optimal margin classifiers
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Predicting {0, 1}-functions on randomly drawn points
Information and Computation
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
Journal of Combinatorial Theory Series A
Random sampling in graph optimization problems
Random sampling in graph optimization problems
The complexity of learning according to two models of a drifting environment
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Large margin classification using the perceptron algorithm
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A unified framework for approximating and clustering data
Proceedings of the forty-third annual ACM symposium on Theory of computing
Learning Big (Image) Data via Coresets for Dictionaries
Journal of Mathematical Imaging and Vision
| Hi-index | 0.01 |