Sciweavers

1632 search results - page 41 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
129
Voted
PRL
2010
205views more  PRL 2010»
14 years 10 months ago
Mining outliers with faster cutoff update and space utilization
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
Chi-Cheong Szeto, Edward Hung
COMPGEOM
2011
ACM
14 years 7 months ago
Metric graph reconstruction from noisy data
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
Mridul Aanjaneya, Frédéric Chazal, D...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 4 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
ECCC
2007
99views more  ECCC 2007»
15 years 3 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
113
Voted
SODA
2008
ACM
125views Algorithms» more  SODA 2008»
15 years 4 months ago
Ultra-low-dimensional embeddings for doubling metrics
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar