ICDE
2012
IEEE
11 years 11 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
SISAP
2010
IEEE
13 years 6 months ago
2010
IEEE
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
PR
2007
13 years 8 months ago
2007
In previous papers [1, 2], we proposed a subspace distance. However, whether the subspace distance satisfies the triangle inequality was left open. In this note, we give positive ...
DAM
1999
13 years 8 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are....
NIPS
2004
13 years 10 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
ALENEX
2001
13 years 10 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
IMC
2007
ACM
13 years 10 months ago
2007
ACM
Many distributed systems rely on neighbor selection mechanisms to create overlay structures that have good network performance. These neighbor selection mechanisms often assume th...
NSDI
2007
13 years 10 months ago
2007
Network coordinates provide a mechanism for selecting and placing servers efficiently in a large distributed system. This approach works well as long as the coordinates continue ...