Sciweavers

404 search results - page 81 / 81
» Many-to-Many Aggregation for Sensor Networks
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 5 months ago
Global Iceberg Detection over Distributed Data Streams
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
Ashwin Lall, Haiquan (Chuck) Zhao, Jun Xu, Mitsuno...
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
ISICT
2003
13 years 6 months ago
Topic maps for context management
Abstract. The advent of context-aware computing requires a new paradigm in information management. Context information in a computing environment will take the form of disparate an...
Ruaidhri Power
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe