Approximate aggregation for tracking quantiles in wireless sensor networks
From MaRDI portal
Recommendations
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Optimal tracking of distributed heavy hitters and quantiles
- A note on efficient aggregate queries in sensor networks
- A note on efficient aggregate queries in sensor networks
- An \(\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})\) space lower bound for finding \(\epsilon \)-approximate quantiles in a data stream
Cites work
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- Aggregation operators. New trends and applications
- Approximate aggregation for tracking quantiles in wireless sensor networks
- Computing and Combinatorics
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Optimal tracking of distributed heavy hitters and quantiles
Cited in
(7)- Optimal tracking of distributed heavy hitters and quantiles
- Monitoring networked applications with incremental quantile estimation
- Approximate aggregation for tracking quantiles in wireless sensor networks
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
- Metric and distributed on-line algorithm for minimizing routing interference in wireless sensor networks
- A note on efficient aggregate queries in sensor networks
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
This page was built for publication: Approximate aggregation for tracking quantiles in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942390)
