AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets for P. We show the following: pick a random sample Q of size O(1/ϵlog(1/ϵ)) from P. Then, with constant probability, a weak ϵ-net of P can be constructed from only the points of Q. This shows that weak ϵ-nets in Rd can be computed from a subset of P of size O(1/ϵlog(1/ϵ)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/ϵ. However, our final weak ϵ-nets still have a large size (with the dimension appearing in the exponent of 1/ϵ)
We present algorithms for the two layer straightline crossing minimization problem that are able to ...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel ...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\e...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\...
A finite set $N \subset \R^d$ is a {\em weak $\eps$-net} for an $n$-point set $X\subset \R^d$ (with ...
AbstractGiven a set P of points in the plane, a set of points Q is a weak ε-net with respect to a fa...
This thesis deals with strong and weak ǫ-nets in geometry and related problems. In the first ha...
This thesis deals with strong and weak -nets in geometry and related problems. In the first half of...
One of our results: let X be a finite set on the plane, 0 < g < 1, then there exists a set F (...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
In the plane, we can find a weak "-net for convex sets consisting of O(" \Gamma2 ) point...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
We present algorithms for the two layer straightline crossing minimization problem that are able to ...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel ...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\e...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\...
A finite set $N \subset \R^d$ is a {\em weak $\eps$-net} for an $n$-point set $X\subset \R^d$ (with ...
AbstractGiven a set P of points in the plane, a set of points Q is a weak ε-net with respect to a fa...
This thesis deals with strong and weak ǫ-nets in geometry and related problems. In the first ha...
This thesis deals with strong and weak -nets in geometry and related problems. In the first half of...
One of our results: let X be a finite set on the plane, 0 < g < 1, then there exists a set F (...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
In the plane, we can find a weak "-net for convex sets consisting of O(" \Gamma2 ) point...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
We present algorithms for the two layer straightline crossing minimization problem that are able to ...
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points i...
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axis-parallel ...