241 search results - page 19 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
STOC
1998
ACM
14 years 1 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ALGORITHMICA
2005
13 years 8 months ago
2005
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
GCC
2006
Springer
14 years 19 days ago
2006
Springer
Network coordinates provide a practical and efficient way to estimate latencies among hosts in the network. In this paper, we study the problem of designing and implementing a Net...
ICPPW
2007
IEEE
14 years 3 months ago
2007
IEEE
Several challenges about computational grid exist in integrating, coordinating and managing of resources and scheduling of applications, due to distributed resources at various le...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...