Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
From MaRDI portal
Publication:2471714
Recommendations
- Time-decaying sketches for robust aggregation of sensor data
- Time-decaying sketches for sensor data aggregation
- A note on efficient aggregate queries in sensor networks
- A note on efficient aggregate queries in sensor networks
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
Cites work
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- An improved data stream summary: the count-min sketch and its applications
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 4002053 (Why is no real title available?)
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1978130 (Why is no real title available?)
- scientific article; zbMATH DE number 2086662 (Why is no real title available?)
- scientific article; zbMATH DE number 1424312 (Why is no real title available?)
- Probabilistic counting algorithms for data base applications
- Tracking join and self-join sizes in limited storage
Cited in
(6)- A survey of temporal data mining
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Analysis of the structured perturbation for the BCSCB linear system
- Time-decaying sketches for robust aggregation of sensor data
- Time-decaying sketches for sensor data aggregation
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
This page was built for publication: Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471714)