Sciweavers

41 search results - page 3 / 9
» Girth and euclidean distortion
Sort
View
SODA
2008
ACM
125views Algorithms» more  SODA 2008»
13 years 9 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
CONIELECOMP
2009
IEEE
14 years 2 months ago
A Fingerprint Verification Algorithm Using the Smallest Minimum Sum of Closest Euclidean Distance
In this paper, a Euclidean distance based minutia matching algorithm is proposed to improve the matching accuracy in fingerprint verification system. This algorithm extracts match...
Ujjal Kumar Bhowmik, Ashkan Ashrafi, Reza R. Adham...
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
14 years 2 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
TIT
2010
107views Education» more  TIT 2010»
13 years 2 months ago
Rate distortion and denoising of individual data using Kolmogorov complexity
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
Nikolai K. Vereshchagin, Paul M. B. Vitányi
SIGIR
1999
ACM
14 years 8 days ago
Relevance Feedback Retrieval of Time Series Data
There has been much recent interest in retrieval of time series data. Earlier work has used a fixed similarity metric (e.g., Euclidean distance) to determine the similarity betwee...
Eamonn J. Keogh, Michael J. Pazzani