133 search results - page 11 / 27 » Approximate Nearest Subspace Search |
234
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
141
click to vote
ENGL
2008
15 years 2 months ago
2008
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
267
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
145
Voted
TKDE
2008
15 years 2 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...
127
click to vote
DEXA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...