Sciweavers

338 search results - page 20 / 68
» Fast distributed random walks
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim
IPPS
2006
IEEE
15 years 3 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
96
Voted
SAT
2010
Springer
165views Hardware» more  SAT 2010»
14 years 8 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
BIOSYSTEMS
2008
69views more  BIOSYSTEMS 2008»
14 years 9 months ago
Investigations into the design principles in the chemotactic behavior of Escherichia coli
Inspired by the recent studies on the analysis of biased random walk behavior of Escherichia coli[Passino, K.M., 2002. Biomimicry of bacterial foraging for distributed optimizatio...
Tae-Hwan Kim, Sung Hoon Jung, Kwang-Hyun Cho
ASIACRYPT
2005
Springer
15 years 3 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson