ź-nets and simplex range queries
David Haussler,Emo Welzl +1 more
Reads0
Chats0
TLDR
The concept of an ɛ-net of a set of points for an abstract set of ranges is introduced and sufficient conditions that a random sample is an Â-net with any desired probability are given.Abstract:
We demonstrate the existence of data structures for half-space and simplex range queries on finite point sets ind-dimensional space,dÂ?2, with linear storage andO(nÂ?) query time, $$\alpha = \frac{{d(d - 1)}}{{d(d - 1) + 1}} + \gamma for all \gamma > 0$$ .
These bounds are better than those previously published for alldÂ?2. Based on ideas due to Vapnik and Chervonenkis, we introduce the concept of an Â?-net of a set of points for an abstract set of ranges and give sufficient conditions that a random sample is an Â?-net with any desired probability. Using these results, we demonstrate how random samples can be used to build a partition-tree structure that achieves the above query time.read more
Citations
More filters
Book ChapterDOI
The Median Hypothesis
TL;DR: This work defines a measure of “depth” for hypotheses to measure their proximity to the Bayesian optimal hypothesis and shows that deeper hypotheses have stronger generalization bounds and proposes algorithms to find the deepest hypothesis, referred to as the median hypothesis.
Journal ArticleDOI
On Weak $$\epsilon $$ ϵ -Nets and the Radon Number
TL;DR: It is shown that the Radon number characterizes the existence of weak nets in separable convexity spaces and proves an amplification result for weak $$epsilon $$ -nets.
Journal ArticleDOI
On the VC-dimension of half-spaces with respect to convex sets
TL;DR: A quadratic lower bound in the number of pairs of intersecting sets in a shattered family of convex sets in the plane is provided, and it is shown that the VC-dimension is unbounded for pairwise disjoint conveX sets in R^d, for d > 2.
Posted Content
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
Nikhil Bansal,Jatin Batra +1 more
TL;DR: This work considers general covering problems with non-uniform capacities, and gives a new method to handle capacities in a way that completely preserves their geometric structure, and uses this approach to obtain O(1) or inverse Ackermann type bounds for several basic capacitated covering problems.
References
More filters
Book ChapterDOI
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
TL;DR: This chapter reproduces the English translation by B. Seckler of the paper by Vapnik and Chervonenkis in which they gave proofs for the innovative results they had obtained in a draft form in July 1966 and announced in 1968 in their note in Soviet Mathematics Doklady.
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.
Journal ArticleDOI
On the density of families of sets
TL;DR: This paper will answer the question in the affirmative by determining the exact upper bound of T if T is a family of subsets of some infinite set S then either there exists to each number n a set A ⊂ S with |A| = n such that |T ∩ A| = 2n or there exists some number N such that •A| c for each A⩾ N and some constant c.
Journal ArticleDOI
Central Limit Theorems for Empirical Measures
TL;DR: In this article, the convergence of a stochastic process indexed by a Gaussian process to a certain Gaussian processes indexed by the supremum norm was studied in a Donsker class.
Journal ArticleDOI
The power of geometric duality
TL;DR: A new formulation of the notion of duality that allows the unified treatment of a number of geometric problems is used, to solve two long-standing problems of computational geometry and to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen amongn points in the plane.