1949 search results - page 156 / 390 » Random graphs on surfaces |
144
Voted
FGR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
133
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
140
Voted
CSDA
2010
15 years 4 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...
175
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
142
click to vote
ISAAC
2005
Springer
15 years 10 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 ...