4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DB2007★ 4 cited
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Daniel Lemire, Martin Brooks, Yuhong Yan
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting a sequence in up to K segments. We want segments to be as monotonic as po…
cs.DS2007
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Daniel Lemire, Martin Brooks, Yuhong Yan
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as poss…