33 search results - page 2 / 7 » Graph Matching using Adjacency Matrix Markov Chains |
WWW
2005
ACM
14 years 6 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
PR
2008
13 years 5 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
ICPR
2000
IEEE
14 years 6 months ago
2000
IEEE
We describe a method for learning statistical models of images using a second-order hidden Markov mesh model. First, an image can be segmented in a way that best matches its stati...
CIARP
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...