1082 search results - page 64 / 217 » Approximation Algorithms for Spreading Points |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
ISAAC
2009
Springer
14 years 2 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 ...
TFS
2008
13 years 6 months ago
2008
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
SSD
2009
Springer
14 years 2 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...