A composition theorem for learning algorithms with applications to geometric concept classes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A new composition theorem for learning algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Restricted-Focus-of-Attention Learnability of Boolean Functions
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Learning specialist decision lists
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning expressions and programs over monoids
Information and Computation
Measuring teachability using variants of the teaching dimension
Theoretical Computer Science
Learning expressions and programs over monoids
Information and Computation
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
On evolvability: the swapping algorithm, product distributions, and covariance
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Teaching classes with high teaching dimension using few examples
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |