158 search results - page 22 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
ISBI
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper introduces a new method based on k-Nearest Neighbors Graphs (KNNG) for bringing into alignment multiple views of the same scene acquired at two different time points. T...
COMPGEOM
2010
ACM
15 years 2 months 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...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
102
click to vote
TKDE
2008
14 years 9 months ago
2008
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
112
click to vote
MMM
2011
Springer
14 years 1 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...