Sciweavers

ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—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...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
13 years 10 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
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...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 10 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
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. ...
Victor Sepulveda, Benjamin Bustos
PR
2007
130views more  PR 2007»
13 years 12 months ago
Further results on the subspace distance
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 ...
Xichen Sun, Liwei Wang, Jufu Feng
DAM
1999
132views more  DAM 1999»
14 years 3 days ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
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 ...
Giovanni Righini, Marco Trubian
CORR
2004
Springer
91views Education» more  CORR 2004»
14 years 8 days ago
Metrics for more than two points at once
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....
David Wolpert
NIPS
2004
14 years 1 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
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...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
14 years 1 months ago
A Probabilistic Spell for the Curse of Dimensionality
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...
Edgar Chávez, Gonzalo Navarro
IMC
2007
ACM
14 years 2 months ago
Towards network triangle inequality violation aware distributed systems
Many distributed systems rely on neighbor selection mechanisms to create overlay structures that have good network performance. These neighbor selection mechanisms often assume th...
Guohui Wang, Bo Zhang, T. S. Eugene Ng
NSDI
2007
14 years 2 months ago
Network Coordinates in the Wild
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 ...
Jonathan Ledlie, Paul Gardner, Margo I. Seltzer