17 search results - page 4 / 4 » Heuristic and Exact Methods for the Discrete (r |p)-Centroid... |
COMPGEOM
2005
ACM
13 years 8 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
TSP
2008
13 years 6 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...