235 search results - page 5 / 47 » The Complexity of Separating Points in the Plane |
APPML
2007
14 years 11 months ago
2007
We describe a class of inhomogeneous two-dimensional porous medium flows, driven by a finite number of multipole sources; the free boundary dynamics can be parametrized by polyn...
DCG
2007
14 years 11 months ago
2007
We extend to topological affine planes the standard theorems of convexity, among them the separation theorem, the anti-exchange theorem, Radon’s, Helly’s, Carath´eodory’s,...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
101
click to vote
JMLR
2010
14 years 6 months ago
2010
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...