Learning read-once formulas with queries
Journal of the ACM (JACM)
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the query complexity of learning
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
Analysis of upper bound in Valiant's model for learning bounded CNF expressions
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
On the Fourier spectrum of monotone functions
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Efficient noise-tolerant learning from statistical queries
Journal of the ACM (JACM)
Using homogenous weights for approximating the partial cover problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
What do Constructive Learners Really Learn?
Artificial Intelligence Review
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
On the Learnability of Hidden Markov Models
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
GA-Based Learning of kDNFns Boolean Formulas
ICES '01 Proceedings of the 4th International Conference on Evolvable Systems: From Biology to Hardware
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Knowledge Engineering Review
Approximation algorithms for partial covering problems
Journal of Algorithms
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Can user models be learned at all? Inherent problems in machine learning for user modelling
The Knowledge Engineering Review
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Guest editorial: Learning theory
Machine Learning
The discoverability of the web
Proceedings of the 16th international conference on World Wide Web
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
ACM Computing Surveys (CSUR)
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Proceedings of the VLDB Endowment
Some connections between learning and optimization
Discrete Applied Mathematics
Refinement of uncertain rule bases via reduction
International Journal of Approximate Reasoning
On partial covers, reducts and decision rules with weights
Transactions on rough sets VI
Approximation of partial capacitated vertex cover
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Analysing bioHEL using challenging boolean functions
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Forming concepts for fast inference
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
On approximation of the submodular set cover problem
Operations Research Letters
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Journal of Discrete Algorithms
| Hi-index | 0.00 |