Sciweavers

255 search results - page 47 / 51
» Approximate Query Answering on Sensor Network Data Streams
Sort
View
MOBIDE
2006
ACM
14 years 4 months ago
Towards correcting input data errors probabilistically using integrity constraints
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...
Nodira Khoussainova, Magdalena Balazinska, Dan Suc...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 4 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ICFP
2008
ACM
14 years 10 months ago
Flask: staged functional programming for sensor networks
Severely resource-constrained devices present a confounding challenge to the functional programmer: we are used to having powerful ion facilities at our fingertips, but how can we...
Geoffrey Mainland, Greg Morrisett, Matt Welsh
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 11 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
BDA
2007
14 years 9 days ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...