Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
From MaRDI portal
Publication:2471714
DOI10.1007/s00453-007-9098-2zbMath1153.68323MaRDI QIDQ2471714
Vasundhara Puttagunta, Konstantinos Kalpakis
Publication date: 18 February 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9098-2
68M10: Network design and communication in computer systems
Related Items
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
Uses Software
Cites Work
- Tracking join and self-join sizes in limited storage
- Probabilistic counting algorithms for data base applications
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- An improved data stream summary: the count-min sketch and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item