Sciweavers

1541 search results - page 35 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
FOCS
1999
IEEE
14 years 1 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
COMBINATORICA
2010
13 years 6 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 9 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
PERCOM
2009
ACM
14 years 4 months ago
Randomizing RFID Private Authentication
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
Qingsong Yao, Yong Qi, Jinsong Han, Jizhong Zhao, ...
CHES
2005
Springer
170views Cryptology» more  CHES 2005»
14 years 2 months ago
Design of Testable Random Bit Generators
Abstract. In this paper, the evaluation of random bit generators for security applications is discussed and the concept of stateless generator is introduced. It is shown how, for t...
Marco Bucci, Raimondo Luzzi