scientific article; zbMATH DE number 7559216

DOI10.4230/LIPIcs.SoCG.2019.16MaRDI QIDQ5088943

David P. Woodruff, William Kuszmaul, Vladimir Braverman, Lin F. Yang, Moses Charikar

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic time warpingtree metricsone-way communication complexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Pattern matching under DTW distance

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient Communication Protocols for Deciding Edit Distance
• Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
• Low Dimensional Embeddings of Doubling Metrics
• A linear space algorithm for computing maximal common subsequences
• Dynamic programming algorithm optimization for spoken word recognition
• Probabilistic clustering of high dimensional norms
• Dynamic Time Warping and Geometric Edit Distance
• A tight bound on approximating arbitrary metrics by tree metrics