Improved lower bounds for learning from noisy examples: an information-theoretic approach
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The complexity of learning according to two models of a drifting environment
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the sample complexity of learning functions with bounded variation
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Sample-efficient strategies for learning in the presence of noise
Journal of the ACM (JACM)
The Complexity of Learning According to Two Models of a Drifting Environment
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Efficient algorithms for learning functions with bounded variation
Information and Computation
Some connections between learning and optimization
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Some connections between learning and optimization
Discrete Applied Mathematics
Generalization behaviour of alkemic decision trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
| Hi-index | 0.00 |