606 search results - page 114 / 122 » Combinatorial Markov Random Fields |
137
click to vote
CAIP
2009
Springer
14 years 11 months ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
AAAI
2006
15 years 2 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
142
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
116
click to vote
ICDAR
2007
IEEE
15 years 7 months ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
144
click to vote
SIAMIS
2010
14 years 8 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...