860 search results - page 48 / 172 » Biased Random Walks |
SODA
2012
ACM
12 years 1 months ago
2012
ACM
KDD
2008
ACM
14 years 11 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
CIMCA
2006
IEEE
14 years 5 months ago
2006
IEEE
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...