9 search results - page 1 / 2 » Achieving Spatial Adaptivity while Finding Approximate Neare... |
97
Voted
CCCG
2008
14 years 11 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
109
click to vote
TIP
2002
14 years 9 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
PAMI
2008
14 years 9 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
MDM
2010
Springer
14 years 11 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
185
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...