180 search results - page 24 / 36 » Learning random walks to rank nodes in graphs |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ICCV
2009
IEEE
15 years 15 days ago
2009
IEEE
This paper introduces an algorithm for detecting walking
motion using point trajectories in video sequences. Given
a number of point trajectories, we identify those which are
sp...