Sciweavers

192 search results - page 39 / 39
» Fair data collection in wireless sensor networks: analysis a...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
EMNETS
2007
13 years 9 months ago
Image browsing, processing, and clustering for participatory sensing: lessons from a DietSense prototype
Imagers are an increasingly significant source of sensory observations about human activity and the urban environment. ImageScape is a software tool for processing, clustering, an...
Sasank Reddy, Andrew Parker, Josh Hyman, Jeff Burk...