Symmetric norm estimation and regression on sliding windows
From MaRDI portal
Publication:2695322
DOI10.1007/978-3-030-89543-3_44OpenAlexW3211088485MaRDI QIDQ2695322
Samson Zhou, Vladimir Braverman, Viska Wei
Publication date: 30 March 2023
Full work available at URL: https://arxiv.org/abs/2109.01635
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal sampling from sliding windows
- How to catch \(L_2\)-heavy-hitters on sliding windows
- The space complexity of approximating the frequency moments
- On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
- Estimating Entropy and Entropy Norm on Data Streams
- Optimal approximations of the frequency moments of data streams
- Clustering Problems on Sliding Windows
- An Approximate L1 -Difference Algorithm for Massive Data Streams
- Streaming symmetric norms via measure concentration
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows.
- Clustering on Sliding Windows in Polylogarithmic Space.
- Zero-One Laws for Sliding Windows and Universal Sketches
This page was built for publication: Symmetric norm estimation and regression on sliding windows