1541 search results - page 3 / 309 » Analysis of Random Noise and Random Walk Algorithms |
SACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
ISPDC
2008
IEEE
14 years 22 days ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
ICDM
2009
IEEE
14 years 1 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
VMV
2001
13 years 7 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...