217 search results - page 18 / 44 » Searching in metric spaces with user-defined and approximate... |
ADHOCNOW
2003
Springer
14 years 26 days ago
2003
Springer
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
JCSS
2002
13 years 7 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
PAMI
2011
13 years 2 months ago
2011
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...