University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Valued Constraint Satisfaction Problems

Valued Constraint Satisfaction Problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

VMVW01 - Variational methods, new optimisation techniques and new fast numerical algorithms

I will consider the Valued Constraint Satisfaction Problem (VCSP), whose goal is to minimize a sum of local terms where each term comes from a fixed set of functions (called a “language”) over a fixed discrete domain. I will present recent results characterizing languages that can be solved using the basic LP relaxation. This includes languages consisting of submodular functions, as well as their generalizations.

One of such generalizations is k-submodular functions. In the second part of the talk I will present an application of such functions in computer vision.

Based on joint papers with Igor Gridchyn, Andrei Krokhin, Michal Rolinek, Johan Thapper and Stanislav Zivny. 

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity