Sciweavers

34 search results - page 5 / 7
» A Hyper-arc Consistency Algorithm for the Soft Alldifferent ...
Sort
View
ICML
2007
IEEE
14 years 7 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
CP
2004
Springer
13 years 11 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
CVPR
2012
IEEE
11 years 8 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
ICASSP
2011
IEEE
12 years 9 months ago
New results on adaptive computational resource allocation in soft MIMO detection
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson
TIP
2010
94views more  TIP 2010»
13 years 25 days ago
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
Wenxian Yang, Jianfei Cai, Jianmin Zheng, Jiebo Lu...