Sciweavers

1778 search results - page 157 / 356
» On the Power of the Randomized Iterate
Sort
View
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 6 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
ICCAD
2004
IEEE
151views Hardware» more  ICCAD 2004»
16 years 3 months ago
Dynamic range estimation for nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
WONS
2012
IEEE
14 years 2 months ago
Obfuscating IEEE 802.15.4 communication using secret spreading codes
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
ICC
2009
IEEE
124views Communications» more  ICC 2009»
16 years 1 months ago
Distributed Interference Pricing for the MIMO Interference Channel
Abstract—We study distributed algorithms for updating transmit precoding matrices for a two-user Multi-Input/Multi-Output (MIMO) interference channel. Our objective is to maximiz...
Changxin Shi, David A. Schmidt, Randall A. Berry, ...