Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
From MaRDI portal
Publication:5111355
Recommendations
- Dynamic time warping and geometric edit distance: breaking the quadratic barrier
- Approximating dynamic time warping and edit distance for a pair of point sequences
- Towards Efficient Interactive Computation of Dynamic Time Warping Distance
- Fast exact dynamic time warping on run-length encoded time series
- Faster retrieval with a two-pass dynamic-time-warping lower bound
Cited in
(14)- Pattern matching under DTW distance
- The one-way communication complexity of dynamic time warping distance
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- Approximating the geometric edit distance
- Dynamic time warping and geometric edit distance: breaking the quadratic barrier
- Approximating dynamic time warping and edit distance for a pair of point sequences
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
- Quaternion Dynamic Time Warping
- Towards Efficient Interactive Computation of Dynamic Time Warping Distance
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Dynamic time warping under translation: approximation guided by space-filling curves
- Computing continuous dynamic time warping of time series in polynomial time
- Dynamic time warping under translation: approximation guided by space-filling curves
This page was built for publication: Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111355)
