ź-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
Yet even more on sampling
TL;DR: In this paper, the authors extend the sampling results shown in the previous chapter and provide more general tools for using them, and prove stronger bounds on sampling and provide a more general framework for using these results.
Journal ArticleDOI
Solving the Classification Problem Using ε-nets
M. A. Ivanchuk,I. V. Malyk +1 more
TL;DR: The weak convergence of the normalized difference of empirical and theoretical separation curves to the normal distribution is proved and makes it possible to check the hypothesis about the place of theoretical separation curve at a specific point.
Algorithms for Finding Multivariate Discriminant Rules for Classification and Regression Trees
TL;DR: In order to handle various types of correlations, the author proposed multivariate optimized discriminant rules that can be defined on more than one attribute and presented efficient algorithms for finding the rules.
Journal ArticleDOI
Packing and covering balls in graphs excluding a minor
Nicolas Bousquet,Wouter Cames van Batenburg,Louis Esperet,Gwenaël Joret,William Lochet,Carole Muller,François Pirot,François Pirot +7 more
TL;DR: It is proved that for every integer t ⩾ 1 there exists a constant c t such that forevery K t -minor-free graph G, and every set S of balls in G, the minimum size of a set of vertices intersecting all the balls of S is at most c t times the maximum number of vertex-disjoint balls in S.
Posted Content
Shallow Packings in Geometry.
TL;DR: It is concluded that set systems of halfspaces, balls, and parallel slabs defined over $n$ points in $d$-space admit better packing numbers when $k$ is smaller than $n$.
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.