Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension

Authors:
N. Alon;D. Haussler;E. Welzl
Affiliations:
Department of Mathematics, Tel Aviv University, Ramat Aviv, TEL Aviv 69978, Israel;Computer Science Department, University of California at Santa Cruz, Santa Cruz, CA, USA;Institutes for Information Processing, Technical University of Graz, Schiesstattgaser 4a, A-8010 GRAZ, Austria
Venue:
SCG '87 Proceedings of the third annual symposium on Computational geometry
Year:
1987

Applications of random sampling in computational geometry, II

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Partition trees for triangle counting and other range searching problems

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Some weak learning results

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Geometric range searching

ACM Computing Surveys (CSUR)
Shifting: One-inclusion mistake bounds and sample compression

Journal of Computer and System Sciences

Hi-index	0.00