On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On learning decision trees with large output domains (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Simple learning algorithms using divide and conquer
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
How many queries are needed to learn?
Journal of the ACM (JACM)
Learning Sat-k-DNF formulas from membership queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
More efficient PAC-learning of DNF with membership queries under the uniform distribution
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Implementation Issues in the Fourier Transform Algorithm
Machine Learning
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Quantum DNF Learnability Revisited
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Exact Learning when Irrelevant Variables Abound
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
On Boosting with Optimal Poly-Bounded Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On boosting with polynomially bounded distributions
The Journal of Machine Learning Research
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Journal of the ACM (JACM)
A practical generalization of Fourier-based learning
ICML '05 Proceedings of the 22nd international conference on Machine learning
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
What's new: finding significant differences in network data streams
IEEE/ACM Transactions on Networking (TON)
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
Unconditional lower bounds for learning intersections of halfspaces
Machine Learning
List-decoding reed-muller codes over small fields
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Decodability of group homomorphisms beyond the johnson bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Agnostically learning decision trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning unions of ω(1)-dimensional rectangles
Theoretical Computer Science
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Separating models of learning with faulty teachers
Theoretical Computer Science
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Parameterized learnability of juntas
Theoretical Computer Science
Search techniques for Fourier-based learning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Beyond Nyquist: efficient sampling of sparse bandlimited signals
IEEE Transactions on Information Theory
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Discrete Applied Mathematics
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
Dynamic successive feed-forward neural network for learning fuzzy decision tree
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
On noise-tolerant learning of sparse parities and related problems
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Private data release via learning thresholds
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Combinatorial algorithms for compressed sensing
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Local decoding and testing for homomorphisms
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Simulating quantum computers with probabilistic methods
Quantum Information & Computation
Journal of Computer and System Sciences
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Learning probabilistic automata: A study in state distinguishability
Theoretical Computer Science
Proceedings of the 2013 ACM workshop on Artificial intelligence and security
Gems in decision tree complexity revisited
ACM SIGACT News
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.07 |