2084 search results - page 239 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
105
click to vote
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Inst...
ICCD
2003
IEEE
15 years 7 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
103
click to vote
TCC
2009
Springer
15 years 10 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
PKC
2005
Springer
15 years 3 months ago
2005
Springer
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...