Towards Efficient Interactive Computation of Dynamic Time Warping Distance

DOI10.1007/978-3-030-59212-7_3MaRDI QIDQ6485916zbMATH OpenFDO

Authors Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Publication date 22 December 2022

Published in 1511.68352 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59212-7_3

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
• Fast exact dynamic time warping on run-length encoded time series
• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• Dynamic edit distance table under a general weighted cost function
• Approximating dynamic time warping and edit distance for a pair of point sequences

Cited in

(5)

• The DTW data distribution over a grid computing architecture
• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
• The one-way communication complexity of dynamic time warping distance
• Pattern matching under DTW distance

This page was built for publication: Towards Efficient Interactive Computation of Dynamic Time Warping Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485916)