scientific article; zbMATH DE number 2019620
From MaRDI portal
Publication:4440423
zbMath1028.68949MaRDI QIDQ4440423
T. S. Jayram, Ravi Kumar, Ziv Bar-Yossef, D. Sivakumar, Luca Trevisan
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Counting distinct items over update streams ⋮ A Statistical Analysis of Probabilistic Counting Algorithms ⋮ Spatially-decaying aggregation over a network ⋮ Revisiting maximum satisfiability and related problems in data streams ⋮ Estimating hybrid frequency moments of data streams ⋮ Unnamed Item ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Chebyshev polynomials, moment matching, and optimal estimation of the unseen ⋮ Sample complexity of the distinct elements problem ⋮ Boosting distinct random sampling for basic counting on the union of distributed streams ⋮ Unnamed Item ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ⋮ Better size estimation for sparse matrix products ⋮ Give me some slack: efficient network measurements ⋮ Exponential time improvement for min-wise based algorithms ⋮ Order statistics and estimating cardinalities of massive data sets ⋮ Approximate set union via approximate randomization ⋮ Approximate set union via approximate randomization ⋮ Two improved range-efficient algorithms for \(F_0\) estimation ⋮ A second look at counting triangles in graph streams ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows ⋮ A Note on Estimating Hybrid Frequency Moment of Data Streams ⋮ Unnamed Item ⋮ Arthur-Merlin streaming complexity
This page was built for publication:
