134 search results - page 17 / 27 » Approximate Nearest Neighbor Queries in Fixed Dimensions |
172
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
174
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
104
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
90
Voted
VLDB
2004
ACM
15 years 2 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...