29 search results - page 1 / 6 » Counting Solution Clusters in Graph Coloring Problems Using ... |
120
Voted
NIPS
2008
15 years 3 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
123
Voted
ICAI
2010
15 years 5 days ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
145
Voted
CIARP
2009
Springer
15 years 19 hour ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
117
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
107
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...