4541 search results - page 364 / 909 » Cache-Oblivious Algorithms and Data Structures |
132
click to vote
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
181
click to vote
MMM
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
148
click to vote
MOBIDE
2005
ACM
15 years 10 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
152
click to vote
3DPVT
2004
IEEE
15 years 8 months ago
2004
IEEE
We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approxi...
140
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...