Effective Computations on Sliding Windows

DOI10.1137/090749281zbMath1207.68163OpenAlexW2019766199MaRDI QIDQ3068626

Rafail Ostrovsky, Vladimir Braverman

Publication date: 17 January 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c26d8cc2f67722d00525ddf2f3f865db807738fd

zbMATH Keywords

randomized algorithmsdata streamssliding windowssmooth histograms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ A general method for estimating correlated aggregates over a data stream ⋮ Optimal Random Sampling from Distributed Streams Revisited

This page was built for publication: Effective Computations on Sliding Windows