Search Results for author:
Found 5 papers, 0 papers with code
Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value.
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
Bayesian networks are probabilistic graphical models with a wide range of application areas including gene regulatory networks inference, risk analysis and image processing.
Exact and approximate inference in graphical models: variable elimination and beyond
We illustrate the techniques reviewed in this article on benchmarks of inference problems in genetic linkage analysis and computer vision, as well as on hidden variables restoration in coupled Hidden Markov Models.
Tractability and Decompositions of Global Cost Functions
A global cost function is called tractable projection-safe when applying an EPT to it is tractable and does not break the tractability property.
Bounds Arc Consistency for Weighted CSPs
Motivated by the resolution of an RNA gene localization problem inside large genomic sequences, and in the spirit of bounds consistency for large domains in crisp CSPs, we introduce soft bounds arc consistency, a new weighted local consistency specifically designed for WCSP with very large domains.
