Search Sciweavers | Sciweavers

1100 search results - page 11 / 220

» Approximate distance oracles

click to vote

WDAG
2009
Springer

147views Algorithms» more WDAG 2009»

Compact Routing in Power-Law Graphs

14 years 3 months ago

Download research.microsoft.com

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...

Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...

claim paper

Read More »

click to vote

ICDE
2002
IEEE

126views Database» more ICDE 2002»

Fast Mining of Massive Tabular Data via Approximate Distance Computations

14 years 9 months ago

Download dimacs.rutgers.edu

Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthu...

claim paper

Read More »

click to vote

CCCG
2007

138views Computational Geometry» more CCCG 2007»

Approximations of Geodesic Distances for Incomplete Triangular Manifolds

13 years 10 months ago

Download cg.scs.carleton.ca

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...

Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...

claim paper

Read More »

click to vote

APPROX
2007
Springer

112views Algorithms» more APPROX 2007»

On Approximating the Average Distance Between Points

14 years 2 months ago

Download www.cs.huji.ac.il

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...

Kfir Barhum, Oded Goldreich, Adi Shraibman

claim paper

Read More »

click to vote

CIAC
2006
Springer

110views Algorithms» more CIAC 2006»

Distance Approximating Trees: Complexity and Algorithms

14 years 5 days ago

Download www.cs.kent.edu

Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )

Feodor F. Dragan, Chenyu Yan

claim paper