Sciweavers

12 search results - page 1 / 3
» Lower bounds for embedding edit distance into normed spaces
Sort
View
SODA
2003
ACM
88views Algorithms» more  SODA 2003»
13 years 6 months ago
Lower bounds for embedding edit distance into normed spaces
Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr ...
JCT
2008
100views more  JCT 2008»
13 years 4 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin
VLDB
2004
ACM
106views Database» more  VLDB 2004»
13 years 10 months ago
On The Marriage of Lp-norms and Edit Distance
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
Lei Chen 0002, Raymond T. Ng
FOCS
2004
IEEE
13 years 8 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
JCB
2006
115views more  JCB 2006»
13 years 4 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger