33 search results - page 6 / 7 » Graph Matching using Adjacency Matrix Markov Chains |
124
Voted
DKE
2007
15 years 1 months ago
2007
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
125
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
87
Voted
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
105
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
127
Voted
TCSV
2002
15 years 23 days ago
2002
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...