Fast, small-space algorithms for approximate histogram maintenance

From MaRDI portal
Revision as of 02:45, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3579236

DOI10.1145/509907.509966zbMath1192.68962OpenAlexW2047424291MaRDI QIDQ3579236

No author found.

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509966




Related Items (20)

Finding frequent items in data streamsBook Review: A mathematical introduction to compressive sensingComment: Monitoring networked applications with incremental quantile estimationDerandomized constructions of \(k\)-wise (almost) independent permutationsAn information statistics approach to data stream and communication complexityAdapting parallel algorithms to the W-stream model, with applications to graph problemsMultiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$Summarizing numeric spatial data streams by trend cluster discoveryChallenges in benchmarking stream learning algorithms with real-world dataStreaming techniques and data aggregation in networks of tiny artefactsFinding longest increasing and common subsequences in streaming dataFast Private Norm Estimation and Heavy HittersCompressed sensing and best 𝑘-term approximationCoSaMP: Iterative signal recovery from incomplete and inaccurate samplesPrivate multiparty sampling and approximation of vector combinationsDiscovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A SurveyMultiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacyUnnamed ItemOn graph problems in a semi-streaming model







This page was built for publication: Fast, small-space algorithms for approximate histogram maintenance