16 search results - page 2 / 4 » Smooth Tradeoffs between Insert and Query Complexity in Near... |
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
SODA
2004
ACM
13 years 6 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 6 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...