J. Pach and G. Woginger. Some new bounds for epsilon-nets. In Proc. 6th ACM Symposium on Computational Geometry, pages 10-- 15, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Sample compression, learnability, and the Vapnik-Chervonenkis .. - Floyd, Warmuth (1995) (6 citations) (Correct)
.... of VC dimension d for which there are learning algorithms that produce consistent hypotheses from the same class that require sample size Omega 1 ffl (d log 1 ffl log 1 ffi ) This essentially follows from lower bounds on the size of ffl nets for concept classes of VC dimension d from Pach and Woeginger (1990) and Littlestone, Haussler, and Warmuth (1994) Similarly, following Littlestone et al. 1994) one can show that there are concept classes of VC dimension d with a learning algorithm using a compression scheme of size d that requires the same sample size. Ehrenfeucht, Haussler, Kearns, and ....
Pach, J., and Woeginger, G. (1990). Some new bounds for epsilon-nets. Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, California, 10-15.
How to Net a Lot with Little: Small ε-Nets for Disks.. - Matousek, al. (2000) (Correct)
No context found.
J. Pach and G. Woginger. Some new bounds for epsilon-nets. In Proc. 6th ACM Symposium on Computational Geometry, pages 10-- 15, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC