On Approximating the Average Distance Between Points

15 years 10 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 consider two algorithmic approaches:

Kfir Barhum, Oded Goldreich, Adi Shraibman

Real-time Traffic

Algorithms | APPROX 2007 | Average Distance |

claim paper

» Approximating Average Parameters of Graphs

» Geographic Quorum System Approximations

» Face Recognition Using Sparse Approximated Nearest Points between Image Sets

» Query Processing Using Distance Oracles for Spatial Networks

» Continuous Medoid Queries over Moving Objects

» Matching Point Sets with Respect to the Earth Movers Distance

» Norm Point and Distance Estimation Over Multiple Signals Using MaxStable Distributions

» Maintaining the Approximate Width of a Set of Points in the Plane

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	APPROX
Authors	Kfir Barhum, Oded Goldreich, Adi Shraibman

Comments (0)

Sciweavers

On Approximating the Average Distance Between Points

Algorithms | APPROX 2007 | Average Distance |

Explore & Download

Productivity Tools

Sciweavers