Approximating Hyper-Rectangles: Learning and Pseudorandom Sets
- 1 December 1998
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 57 (3), 376-388
- https://doi.org/10.1006/jcss.1998.1593
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Discrepancy sets and pseudorandom generators for combinatorial rectanglesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Note on Learning from Multiple-Instance ExamplesMachine Learning, 1998
- Solving the multiple instance problem with axis-parallel rectanglesArtificial Intelligence, 1997
- Explicit Ramsey graphs and orthonormal labelingsThe Electronic Journal of Combinatorics, 1994
- Improved algorithms via approximations of probability distributions (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A Note on Ramsey's TheoremCanadian Mathematical Bulletin, 1972