Sciweavers

1973 search results - page 143 / 395
» Gossip based streaming
Sort
View
141
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 4 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
159
Voted
EWSN
2010
Springer
16 years 25 days ago
Selective Reprogramming of Mobile Sensor Networks through Social Community Detection
Abstract. We target application domains where the behavior of animals or humans is monitored using wireless sensor network (WSN) devices. The code on these devices is updated frequ...
Bence Pásztor, Luca Mottola, Cecilia Mascol...
135
Voted
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 9 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
156
Voted
P2P
2010
IEEE
207views Communications» more  P2P 2010»
15 years 2 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
170
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Convergence results in distributed Kalman filtering
Abstract—The paper studies the convergence properties of the estimation error processes in distributed Kalman filtering for potentially unstable linear dynamical systems. In par...
Soummya Kar, Shuguang Cui, H. Vincent Poor, Jos&ea...