An Approximate L1 -Difference Algorithm for Massive Data Streams
From MaRDI portal
Publication:4785634
DOI10.1137/S0097539799361701zbMath1029.68157MaRDI QIDQ4785634
Sampath Kannan, Mahesh Viswanathan, Joan Feigenbaum, Martin J. Strauss
Publication date: 5 January 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
Communication Complexity of Statistical Distance, Depth First Search in the Semi-streaming Model, Unnamed Item, Adapting parallel algorithms to the W-stream model, with applications to graph problems, An information statistics approach to data stream and communication complexity, Statistical estimation with bounded memory, On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices, Sketching information divergences, Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models, Adaptive sampling for geometric problems over data streams, Finding longest increasing and common subsequences in streaming data, On graph problems in a semi-streaming model, Symmetric norm estimation and regression on sliding windows