Sciweavers

1434 search results - page 240 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
PERCOM
2007
ACM
14 years 7 months ago
Energy-Efficient Data Dissemination for Wireless Sensor Networks
In order to disseminate a large amount of data through a sensor network, it is common to split the data into smallsized chunk packets. If the data is additionally encoded by a for...
Marcel Busse, Thomas Haenselmann, Wolfgang Effelsb...
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
14 years 4 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
P2P
2009
IEEE
126views Communications» more  P2P 2009»
14 years 2 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
14 years 2 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
IWCMC
2009
ACM
14 years 2 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach