2079 search results - page 200 / 416 » Universality of random graphs |
192
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
192
click to vote
GBRPR
2007
Springer
16 years 22 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....
162
click to vote
FOCS
2006
IEEE
16 years 19 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...
175
click to vote
ICAPR
2005
Springer
16 years 3 days 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...
155
click to vote
WEA
2004
Springer
15 years 12 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...