280 search results - page 10 / 56 » Approximate nearest neighbors using sparse representations |
110
Voted
DAS
2010
Springer
15 years 3 months ago
2010
Springer
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
202
click to vote
SIGMOD
2009
ACM
15 years 12 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...
119
click to vote
GIS
2010
ACM
14 years 10 months ago
2010
ACM
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
110
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
85
Voted
ICPR
2002
IEEE
16 years 24 days ago
2002
IEEE
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...