214 search results - page 28 / 43 » Fast Nearest Neighbor Search in High-Dimensional Space |
77
Voted
ICML
1994
IEEE
15 years 29 days ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
72
Voted
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a reliable coin recognition system that is based on a registration approach. To optimally align two coins we search for a rotation in order to reach a maximal n...
91
Voted
ICML
2004
IEEE
15 years 2 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...