1082 search results - page 56 / 217 » Approximation Algorithms for Spreading Points |
COMSWARE
2007
IEEE
14 years 2 months ago
2007
IEEE
— In a Delay Tolerant Network (DTN) the nodes may behave autonomously deciding on their own whether to implement or not the rules of a routing algorithm. In this paper, the effec...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
SGP
2003
13 years 9 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
TSMC
2010
13 years 2 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...