An optimal linear time algorithm for quasi-monotonic segmentation1

DOI10.1080/00207160701694153zbMath1166.62322OpenAlexW2551090992MaRDI QIDQ5190715

Yuhong Yan, Daniel Lemire, Martin Brooks

Publication date: 27 July 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701694153

zbMATH Keywords

monotonicitytime seriesdesign of algorithmssegmentation

Mathematics Subject Classification ID

Uses Software

• PhysioToolkit

Cites Work

• Unnamed Item
• Best piecewise monotone uniform approximation
• Approximation complexity for piecewise monotone functions and real data
• Functional data analysis
• Isotone optimization. I
• Topological persistence and simplification
• Automatic decomposition of time series into step, ramp, and impulse primitives

This page was built for publication: An optimal linear time algorithm for quasi-monotonic segmentation1