Wasserman, Hal
Carnegie Mellon University
2 papers on CoChat
Most cited papers
- Verified
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM
Machine Learning and AlgorithmsComplexity and Algorithms in Graphs
Cited by 598
- Verified
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing
Machine Learning and AlgorithmsComplexity and Algorithms in Graphs
Cited by 128
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free