ź-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
Summary : The fundamental result of Y
TL;DR: Li et al. as discussed by the authors gave a modular, self-contained, intuitive proof of the Chernoff's concentration bound for finite set systems, which can be covered in a single lecture in a geometry, algorithms, or combinatorics course.
Book ChapterDOI
On Alternation, VC-dimension and k-fold Union of Sets
Amit Roy,Jayalal Sarma +1 more
TL;DR: In this paper, a non-geometric set system was proposed for k-fold union of functions with alternation 1, which strictly contains monotone functions and generalizes the bounds in [3].
Posted Content
Low-Rank Methods in Event Detection and Subsampled Point-to-Subspace Proximity Tests
TL;DR: In this article, the authors use a variant of low-rank factorization, which considers interval uncertainty sets around "known entries", on a suitable flattening of the input data to obtain a lowrank model, and perform event detection by running point-to-subspace distance query for incoming data.
Posted Content
Weighted Epsilon-Nets.
TL;DR: This paper analyzes weak weighted $\varepsilon$-nets with respect to convex sets and axis-parallel boxes and gives upper and lower bounds on $\varpsilon$, where it is stronger than the former and weaker than the latter.
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.