BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Valued Constraint Satisfaction Problems - Vladimir Kolmogorov (Ins
 titute of Science and Technology (IST Austria))
DTSTART:20170906T101000Z
DTEND:20170906T110000Z
UID:TALK78081@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:I will consider the Valued Constraint Satisfaction Problem (VC
 SP)\, 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 b
 e solved using the basic LP relaxation. This includes languages consisting
  of submodular functions\, as well as their generalizations. <br><br>One o
 f such generalizations is k-submodular functions. In the second part of th
 e talk I will present an application of such functions in computer vision.
  <br><span><br>Based on joint papers with Igor Gridchyn\, Andrei Krokhin\,
  Michal Rolinek\, Johan Thapper and Stanislav Zivny.&nbsp\;</span>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR