Learning regular sets from queries and counterexamples
Information and Computation
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Negative Results for Equivalence Queries
Machine Learning
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Fast identification of geometric objects with membership queries
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning read-once formulas with queries
Journal of the ACM (JACM)
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the query complexity of learning
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the limits of proper learnability of subclasses of DNF formulas
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Oracles and queries that are sufficient for exact learning (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Geometrical concept learning and convex polytopes
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
How fast can a threshold gate learn?
Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects: constraints and prospects
Simulating access to hidden information while learning
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On training simple neural networks and small-weight neurons
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
On the power of equivalence queries
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Machine Learning
Machine Learning
The VC-Dimensions of Finite Automata with n States
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
How many queries are needed to learn?
Journal of the ACM (JACM)
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
IEEE Annals of the History of Computing - Special issue on Central and Eastern Europe
SIGACT News complexity theory column 32
ACM SIGACT News
The query complexity of finding local minima in the lattice
Information and Computation
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Learning closed horn expressions
Information and Computation
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A General Dimension for Approximately Learning Boolean Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Uniform Characterizations of Polynomial-Query Learnabilities
DS '98 Proceedings of the First International Conference on Discovery Science
How Many Queries Are Needed to Learn One Bit of Information?
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
A General Dimension for Exact Learning
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Uniform characterizations of polynomial-query learnabilities
Theoretical Computer Science
Theoretical Computer Science - Special issue: Algorithmic learning theory
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
Polynomial certificates for propositional classes
Information and Computation
Complexity parameters for first order classes
Machine Learning
A general dimension for query learning
Journal of Computer and System Sciences
Projective DNF formulae and their revision
Discrete Applied Mathematics
Measuring teachability using variants of the teaching dimension
Theoretical Computer Science
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Recent Developments in Algorithmic Teaching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Polynomial certificates for propositional classes
Information and Computation
The subsumption lattice and query learning
Journal of Computer and System Sciences
Teaching dimension and the complexity of active learning
COLT'07 Proceedings of the 20th annual conference on Learning theory
Canonical horn representations and query learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Models of Cooperative Teaching and Learning
The Journal of Machine Learning Research
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Teaching classes with high teaching dimension using few examples
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Time complexity of decision trees
Transactions on Rough Sets III
Active learning via perfect selective classification
The Journal of Machine Learning Research
Activized learning: transforming passive to active with improved label complexity
The Journal of Machine Learning Research
Hi-index | 0.00 |