Approximate aggregation for tracking quantiles and range countings in wireless sensor networks

DOI10.1016/j.tcs.2015.07.056zbMath1358.94028OpenAlexW1092616133MaRDI QIDQ896119

N. E. Zubov

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.056

zbMATH Keywords

quantilesapproximate aggregationrange countings

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

The hardness of resilience for nested aggregation query ⋮ Sampling-based approximate skyline calculation on big data

Cites Work

• Optimal tracking of distributed heavy hitters and quantiles
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Aggregation operators. New trends and applications

This page was built for publication: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks