In-network estimation of frequency moments
From MaRDI portal
Publication:531120
DOI10.1007/s12572-013-0078-2zbMath1342.94012arXiv1210.6134OpenAlexW2103550771MaRDI QIDQ531120
Nutan Limaye, Pooja Vyavahare, D. Manjunath
Publication date: 3 August 2016
Published in: International Journal of Advances in Engineering Sciences and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6134
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size-estimation framework with applications to transitive closure and reachability
- Gossip Algorithms
- Random Geometric Graphs
- Computing separable functions via gossip
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- On Distributed Function Computation in Structure-Free Random Wireless Networks
- Summarizing data using bottom-k sketches
This page was built for publication: In-network estimation of frequency moments