Approximating length-restricted means under dynamic time warping

DOI10.1007/978-3-031-18367-6_12arXiv2112.00408MaRDI QIDQ6176561

Unnamed Author, Anne Driemel, Ioannis Psarros, Koen van Greevenbroek, Maike Buchin

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.00408

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Approximate nearest neighbor for curves: simple, efficient, and deterministic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global averaging method for dynamic time warping, with applications to clustering
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications
• Exact mean computation in dynamic time warping spaces
• Faster retrieval with a two-pass dynamic-time-warping lower bound
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• The vectorization of ITPACK 2C
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Dynamic programming algorithm optimization for spoken word recognition
• Product Range Spaces, Sensitive Sampling, and Derandomization
• Adaptive Global Time Sequence Averaging Method Using Dynamic Time Warping
• Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the Hardness of Computing an Average Curve.

This page was built for publication: Approximating length-restricted means under dynamic time warping