1100 search results - page 11 / 220 » Approximate distance oracles |
112
Voted
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
109
Voted
CCCG
2007
15 years 1 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
96
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )