Partitioning and geometric embedding of range spaces of finite vapnik-chervonenkis dimension

Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Volumn , Issue , 1987, Pages 331-340

  Alon, Naga ^a   Haussler, David ^b   Welzl, Emo ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85014522934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41958.41994     Document Type: Conference Paper

References (10)

1. Alon N. Expanders sorting in rounds and superconcentratbrs of limited depth in "Proc. 17th ACM Symp. on Theory of Comput." (1985) 98-102.
2. Alon, N., Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory, Combinntorica 6 (1986) 207-219.
3. Fredman, M.L., Lower bounds on the complexity of some optimal datastructures, SIAM J. Comput. 10 (1981) 1-10.
4. Hall, M.Jr., Combinatorial Theory, Wiley and Sons, New York, London (1967).
5. Kaussler, D. and Welzl, E., Epsilon-nets and simplex range search, Discrete and Comput. Geom., to appear.
6. Lovasz, L., Combinatorial Problems and Exercises, North-Holland, Amsterdam, New York, Oxford (1979).
7. Sauer N. On the density of families of sets J. Combin. Theory Ser. A 13 (1972) 145-147.
8. Vapnik V.N., Chervonenkis A. YA. On the uniform convergence of relative frequencies of events to their probabilities Theory Probab. Appl. 16 ( 1971) 164-280.
9. Willard, D., Polygon retrieval, SIAM J. Comput. 11 (1982) 149-165.
10. Yao A., Yao F. A general approach to d-dimensional geometric queries in "Proc. 17th ACM Symp. on Theory of Comput." (1985) 163-169.