1542 search results - page 136 / 309 » The metamathematics of random graphs |
115
click to vote
CSDA
2010
15 years 2 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
116
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
121
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
103
click to vote
CAAN
2004
Springer
15 years 7 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
137
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...