Approximating Hyper-Rectangles: Learning and Pseudorandom Sets
Peter L. Auer, Philip M. Long, Aravind Srinivasan · Journal of Computer and System Sciences · 1998
Cited by 45 works. doi:10.1006/jcss.1998.1593
Authors
References
- A theory of the learnable
- Universal classes of hash functions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Learnability and the Vapnik-Chervonenkis dimension
- Solving the multiple instance problem with axis-parallel rectangles
- Computational limitations on learning from examples
- On the learnability of Boolean formulae
- Some remarks on the theory of graphs
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
- A Simple Parallel Algorithm for the Maximal Independent Set Problem