have Vapnik-Chervonenkis dimension d. Let M(k=n;V) denote the cardinality of the largest W ` V such that any two distinct vectors in W differ on at least k indices. We show that M(k=n;V) (cn=(k + d)) d for some constant c. This improves on the previous best result of ((cn=k) log(n=k)) d. This new result has applications in the theory of empirical processes. 1
|
654
|
On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab
– Vapnik, Červonekis
- 1971
|
|
637
|
Estinwtion of Dependences Based on Empirical Data
– Vapnik
- 1982
|
|
536
|
Learnability and the Vapnik-Chervonenkis Dimension
– Blumer, Ehrenfeucht, et al.
- 1989
|
|
372
|
Concrete Mathematics
– Graham, Knuth, et al.
- 1994
|
|
332
|
Convergence of Stochastic Processes
– Pollard
- 1984
|
|
322
|
Decision theoretic generalization of the PAC model for neural net and other learning applications
– Haussler
- 1992
|
|
188
|
Epsilon-nets and simplex range queries
– Haussler, Welzl
- 1987
|
|
176
|
On the density of families of sets
– Sauer
- 1972
|
|
94
|
A deterministic view of random sampling and its use in geometry
– Chazelle, Friedman
- 1990
|
|
92
|
Bounds on the sample complexity of Ba.yesian learning using information theory and the VC dimension
– Haussler, Kearns, et al.
- 1991
|
|
90
|
Central limit theorems for empirical measures
– Dudley
- 1978
|
|
64
|
A course on empirical processes
– Dudley
- 1984
|
|
59
|
Predicting f0; 1g-functions on randomly drawn points
– Haussler, Littlestone, et al.
- 1994
|
|
47
|
Some limit theorems for empirical processes
– Giné, Zinn
- 1984
|
|
36
|
Partition trees for triangle counting and other range searching problems
– Welzl
- 1988
|
|
32
|
A generalization of Sauer's lemma
– Haussler, Long
- 1995
|
|
30
|
Universal Donsker classes and metric entropy
– Dudley
- 1987
|
|
26
|
Balancing Sets of Vectors
– Alon, Bergmann, et al.
- 1988
|
|
26
|
The shifting technique in extremal set theory
– Frankl
- 1987
|
|
25
|
On the trace of finite sets
– FRANKL
- 1983
|
|
15
|
Empirical Processes: Theory and Applications, volume 2
– Pollard
- 1990
|
|
15
|
The Glivenko-Cantelli problem
– Talagrand
- 1987
|
|
13
|
Densit'e et dimension. Annales de l'Institut Fourier
– Assouad
- 1983
|
|
12
|
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension
– Alon, Haussler, et al.
- 1987
|
|
10
|
The complexity of many faces in arrangements of lines and of segments
– Edelsbrunner, Guibas, et al.
- 1988
|
|
10
|
Existence of submatrices with all possible columns
– Steele
- 1978
|
|
8
|
Sharper bounds for empirical processes
– Talagrand
- 1994
|
|
6
|
Induced subsets
– Bondy
- 1972
|
|
4
|
How to net a lot with little: Small epsilon nets for disks and halfspaces
– Matouˇsek, Seidel, et al.
- 1990
|
|
3
|
Quasi-optimal range searching and vc-dimensions
– Chazelle, Welzl
- 1989
|
|
3
|
Donsker classes of sets. Probability Theory and Related Fields, 78:169
– Talagrand
- 1988
|
|
1
|
Donsker classes and random geometry
– Talagrand
- 1987
|
