Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
Journal of Combinatorial Theory Series A
The Vapnik-Chervonenkis dimension of a random graph
Selected papers of the 14th British conference on Combinatorial conference
Learning in Neural Networks: Theoretical Foundations
Learning in Neural Networks: Theoretical Foundations
Concrete Math
| Hi-index | 0.04 |
Let [n]={1,...,n}. For a function h:[n]-{0,1}, x@?[n] and y@?{0,1} define by the width@w"h(x,y) of h at x the largest nonnegative integer a such that h(z)=y on x-a@?z@?x+a. We consider finite VC-dimension classes of functions h constrained to have a width @w"h(x"i,y"i) which is larger than N for all points in a sample @z={(x"i,y"i)}"1^@? or a width no larger than N over the whole domain [n]. Extending Sauer's lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes.