12 search results - page 1 / 3 » Generalized Ham-Sandwich Cuts for Well Separated Point Sets |
CCCG
2008
13 years 6 months ago
2008
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
MP
2006
13 years 4 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...