1186 search results - page 6 / 238 » Improving Random Walk Performance |
HICSS
2006
IEEE
14 years 3 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
CN
2007
13 years 9 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
ICIAP
1999
ACM
14 years 2 months ago
1999
ACM
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
CSR
2007
Springer
14 years 4 months ago
2007
Springer
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
BERTINORO
2005
Springer
14 years 3 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...