ź-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
Journal ArticleDOI
An Algorithm to Construct Separable ź-Nets of Two Sets
M. A. Ivanchuk,I. V. Malyk +1 more
TL;DR: The necessary and sufficient conditions of ε-separability are proved and the algorithm of constructing two separableε-nets of size [2d / ε] is proposed, which can be applied to two sets generated from normally distributed sets.
Proceedings ArticleDOI
The container selection problem
TL;DR: A network resource management problem that is a special case of non-metric k-median, naturally arising in cross platform scheduling and cloud computing, and focuses on obtaining bi-approximation algorithms.
Posted Content
The Regularity Lemma with bounded VC Dimension
TL;DR: In this paper, the authors give a proof of Szemeredi's regularity lemma in the special case of a graph with bounded VC dimension and show that it is possible to obtain "merely" doubly exponential bounds on the size of the partition in this case.
Posted Content
On Strong Centerpoints
TL;DR: The existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations with bounded intersection was shown in this paper, where it was shown that a strong centerpoint does not exist even when Ω(n) is a family of halfspaces in the plane.
The Class Cover Problem with Boxes S. B eregS. Cabello † J. M. D´õaz-Banez ‡ P. Perez-Lantero ‡
C. Seara,I. Ventura +1 more
TL;DR: It is proved that the problem remains NP-hard if the covering boxes are half-strips oriented in any of the four orientations, and it is shown that there exists an O(1)-approximation algorithm.
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.