scientific article; zbMATH DE number 7651119

DOI10.4230/LIPICS.CPM.2020.28MaRDI QIDQ5874459zbMATH OpenFDO

Authors Nathan Schaar, Vincent Froese, Rolf Niedermeier

Publication date 7 February 2023

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

zbMATH Keywords

consensus string problemsminimum 1-separated sumsparse stringstime series averaging

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(7)

• Exact mean computation in dynamic time warping spaces
• Fast exact dynamic time warping on run-length encoded time series
• Tight hardness results for consensus problems on circular strings and time series
• Approximating length-restricted means under dynamic time warping
• Õptimal dynamic time warping on run-length encoded strings
• Fast approximations and coresets for (k,)-median under dynamic time warping
• Approximating dynamic time warping distance between run-length encoded strings

This page was built for publication:

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