Sciweavers

360 search results - page 29 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Distributed Monitoring and Aggregation in Wireless Sensor Networks
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
Changlei Liu, Guohong Cao
93
Voted
IPSN
2005
Springer
15 years 5 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
HOTOS
1999
IEEE
15 years 4 months ago
The Case for Better Throughput Estimation
A Web proxy must accurately predict network performance between itself and its servers and clients in order to make good distillation decisions. In this paper, we show that the cu...
Brian Noble, Li Li, Atul Prakash
EDBT
2006
ACM
190views Database» more  EDBT 2006»
15 years 12 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 1 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...