Sciweavers

481 search results - page 36 / 97
» Distributed Consensus, revisited
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Distributed parameter estimation with selective cooperation
This paper proposes selective update and cooperation strategies for parameter estimation in distributed adaptive sensor networks. A setmembership filtering approach is employed t...
Stefan Werner, Yih-Fang Huang, Marcello L. R. de C...
WICOMM
2008
109views more  WICOMM 2008»
13 years 8 months ago
SYNC-NET: distributed time synchronization in clustered sensor networks
Time synchronization is essential for several ad-hoc network protocols and applications, such as TDMA scheduling and data aggregation. In this paper, we propose a time synchronizat...
Ossama Younis, Sonia Fahmy
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
14 years 26 days ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 3 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma