Sciweavers

253 search results - page 28 / 51
» Faster Approximation of Distances in Graphs
Sort
View
NIPS
2004
13 years 8 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
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
14 years 28 days ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
FOCS
2004
IEEE
13 years 11 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
ICALP
2007
Springer
14 years 1 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 6 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu