Sciweavers

267 search results - page 5 / 54
» Communication Complexity Under Product and Nonproduct Distri...
Sort
View
TWC
2010
13 years 2 months ago
Distributed Node Selection for Sequential Estimation over Noisy Communication Channels
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
SIGCOMM
2012
ACM
11 years 9 months ago
ShadowStream: performance evaluation as a capability in production internet live streaming networks
As live streaming networks grow in scale and complexity, they are becoming increasingly difficult to evaluate. Existing evaluation methods including lab/testbed testing, simulati...
Chen Tian, Richard Alimi, Yang Richard Yang, David...
INFOCOM
2007
IEEE
14 years 1 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
ASPDAC
2008
ACM
94views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Robust on-chip bus architecture synthesis for MPSoCs under random tasks arrival
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
Sujan Pandey, Rolf Drechsler
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months 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