860 search results - page 64 / 172 » Biased Random Walks |
94
Voted
CRYPTO
2010
Springer
15 years 27 days ago
2010
Springer
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC...
109
Voted
RSA
2002
15 years 10 days ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
135
Voted
PERCOM
2009
ACM
15 years 7 months ago
2009
ACM
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
112
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
92
Voted
JCT
2007
15 years 17 days ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...