180 search results - page 13 / 36 » Learning random walks to rank nodes in graphs |
CIMCA
2006
IEEE
14 years 1 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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
FOCS
2003
IEEE
14 years 24 days 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...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
MIR
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...