Finding frequent items in data streams
From MaRDI portal
Publication:1884870
DOI10.1016/S0304-3975(03)00400-6zbMath1071.68020WikidataQ59831030 ScholiaQ59831030MaRDI QIDQ1884870
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Unnamed Item, Faster Kernel Ridge Regression Using Sketching and Preconditioning, Unnamed Item, Unnamed Item, Unnamed Item, Space‐efficient tracking of persistent items in a massive data stream, Tight Bounds for the Subspace Sketch Problem with Applications, Tensor-Structured Sketching for Constrained Least Squares, Unnamed Item, On Approximating Matrix Norms in Data Streams, Sketching for Principal Component Regression, Modeling support changes in streaming item sets, Unnamed Item, Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares, Space-efficient estimation of statistics over sub-sampled streams, Estimating hybrid frequency moments of data streams, Identifying frequent items in distributed data sets, Toward a unified theory of sparse dimensionality reduction in Euclidean space, Voting almost maximizes social welfare despite limited communication, A general method for estimating correlated aggregates over a data stream, Identifying correlated heavy-hitters in a two-dimensional data stream, Fast randomized matrix and tensor interpolative decomposition using countsketch, On deterministic sketching and streaming for sparse recovery and norm estimation, Finding longest increasing and common subsequences in streaming data, Sparser Johnson-Lindenstrauss Transforms, Taylor Polynomial Estimator for Estimating Frequency Moments
Cites Work
