Sciweavers

Share
13 search results - page 1 / 3
» Lower bounds for embedding edit distance into normed spaces
Sort
View
SODA
2003
ACM
88views Algorithms» more  SODA 2003»
9 years 1 months ago
Lower bounds for embedding edit distance into normed spaces
Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr ...
JCT
2008
100views more  JCT 2008»
8 years 12 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»
9 years 5 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
9 years 3 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, ...
SODA
2016
ACM
56views Algorithms» more  SODA 2016»
3 years 8 months ago
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
We initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm · , sparsity paramete...
Arturs Backurs, Piotr Indyk, Ilya Razenshteyn, Dav...
books