Priority sampling for estimation of arbitrary subset sums

From MaRDI portal

Revision as of 01:00, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3546350

Jump to:navigation, search

DOI10.1145/1314690.1314696zbMath1326.68036OpenAlexW2085845250MaRDI QIDQ3546350

N. G. Duffield, Mikkel Thorup, Carstent Lund

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sampling theory, sample surveys (62D05) Network design and communication in computer systems (68M10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

Unnamed Item ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ The query complexity of estimating weighted averages ⋮ Space-efficient estimation of statistics over sub-sampled streams

This page was built for publication: Priority sampling for estimation of arbitrary subset sums

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3546350&oldid=16926223"