233 search results - page 21 / 47 » An Investigation of Practical Approximate Nearest Neighbor A... |
116
Voted
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
110
click to vote
JCB
2002
15 years 2 days ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
221
Voted
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
101
Voted
AMR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
135
click to vote
COMGEO
2004
ACM
15 years 7 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...