BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Valued Constraint Satisfaction Problems - Vladimir
Kolmogorov (Institute of Science and Technology (
IST Austria))
DTSTART;TZID=Europe/London:20170906T111000
DTEND;TZID=Europe/London:20170906T120000
UID:TALK78081AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/78081
DESCRIPTION: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 fixe
d discrete domain. I will present recent results c
haracterizing languages that can be solved using t
he basic LP relaxation. This includes languages co
nsisting of submodular functions\, as well as thei
r generalizations.
One of such generalizat
ions 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 Krokh
in\, Michal Rolinek\, Johan Thapper and Stanislav
Zivny. \;
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR