Communications of the ACM
Learning Nested Differences of Intersection-Closed Concept Classes
Machine Learning
The Strength of Weak Learnability
Machine Learning
Boosting a weak learning algorithm by majority
COLT '90 Proceedings of the third 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
Rank-r decision trees are a subclass of r-decision lists
Information Processing Letters
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Machine Learning
Machine Learning
Machine Learning
Exact Learning of Formulas in Parallel
Machine Learning
Exploring Learnability between Exact and PAC
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
| Hi-index | 0.00 |