688 search results - page 51 / 138 » General Partitioning on Random Graphs |
126
Voted
MICCAI
2005
Springer
16 years 1 months ago
2005
Springer
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
128
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
97
Voted
GECCO
2008
Springer
15 years 1 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...
106
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
101
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...