The DLT priority sampling is essentially optimal

DOI10.1145/1132516.1132539zbMath1301.68166OpenAlexW2036304306MaRDI QIDQ2931379

No author found.

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

integral formulainternet traffictelescopic sumsnetwork measurementpriority samplingsubset sum estimate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Internet topics (68M11) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Optimal sampling from sliding windows ⋮ Weighted sampling without replacement from data streams ⋮ The query complexity of estimating weighted averages ⋮ Space-efficient estimation of statistics over sub-sampled streams

This page was built for publication: The DLT priority sampling is essentially optimal