Communications of the ACM
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A general lower bound on the number of examples needed for learning
Information and Computation
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
On learning a union of half spaces
Journal of Complexity
The Strength of Weak Learnability
Machine Learning
The perceptron algorithm is fast for nonmalicious distributions
Neural Computation
Training a 3-node neural network in NP-complete
Advances in neural information processing systems 1
Boosting a weak learning algorithm by majority
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Composite geometric concepts and polynomial predictability
COLT '90 Proceedings of the third annual workshop on Computational learning theory
COLT '88 Proceedings of the first annual workshop on Computational learning theory
On-line learning of rectangles
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An improved boosting algorithm and its implications on learning complexity
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Information and Computation
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Learning unions of two rectangles in the plane with equivalence queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On-line learning of rectangles in noisy environments
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Statistical queries and faulty PAC oracles
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning unions of boxes with membership and equivalence queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
An optimal parallel algorithm for learning DFA
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Machine Learning
Machine Learning
Noise-tolerant distribution-free learning of general geometric concepts
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
PAC learning intersections of halfspaces with membership queries (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Theoretical Computer Science - Algorithmic learning theory
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
| Hi-index | 0.00 |