402 search results - page 65 / 81 » Nearest Surrounder Queries |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
The gap between the user's information need and query is expanding due to the pervasiveness of Web search. Multimedia question answering is restricted by disjoint infrastruct...
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...