4 search results - page 1 / 1 » Lower bounds for Edit Distance and Product Metrics via Poinc... |
SODA
2010
ACM
13 years 3 months ago
2010
ACM
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
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...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ...
JGO
2010
12 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...