Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
Daniel Lemire
Abstract
The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage.
Create a lesson
Related papers
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
Taisuke Izumi, Naoki Kitamura, Toshimitsu Masuzawa
Socially Fair Clustering: Parameterized Approximation and Local Search
Aditya Anand, Yury Makarychev, Liren Shan
FirstFit online coloring in the random order model
Xinyu Ye, Yuechuan Xu, Zixuan Wang et al.
Scheduling to Maximize Weighted Throughput with an Active-Time Budget
Susanne Albers, G. Wessel van der Heijden
A Simplified Analysis of the Good-Bad 3/2-Approximation Algorithm for Some Minimum-Cost Graph Problems
Shayan Ranjbarzadeh, David P. Williamson, Hannane Yaghoubizade
Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
Ajinkya Gaikwad, Dušan Knop, Tomáš Valla