1542 search results - page 174 / 309 » The metamathematics of random graphs |
185
click to vote
GBRPR
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
160
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
174
click to vote
ICAPR
2005
Springer
15 years 12 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
150
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
152
click to vote
BMVC
2001
15 years 8 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...