77 search results - page 11 / 16 » Sampling directed graphs with random walks |
ICCV
2009
IEEE
16 years 2 months 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...
RSA
2008
14 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
COMBINATORICS
2000
14 years 9 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
WEBI
2005
Springer
15 years 3 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...