3257 search results - page 22 / 652 » Some Results on Effective Randomness |
CORR
2007
Springer
15 years 21 days ago
2007
Springer
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
97
Voted
PKC
2005
Springer
15 years 6 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-...
124
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
113
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
88
Voted
TELE
2008
15 years 19 days ago
2008
This study examines the ``medium-centric'' and ``user-centric'' approaches in investigating the displacement effects of the Internet. Results from a random sam...