1082 search results - page 1 / 217 » Approximation Algorithms for Spreading Points |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
WADS
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
IJIT
2004
13 years 6 months ago
2004
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...