CTU Events
| Today | ||||||
|---|---|---|---|---|---|---|
| « | January 2016 | » | ||||
| Mo | Tu | We | Th | Fr | Sa | Su |
| 1 | 2 | 3 | ||||
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| 25 | 26 | 27 | 28 | 29 | 30 | 31 |
Vladimir Kolmogorov - Valued Constraint Satisfaction Problems
26 Jan 2016 11:00
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.
- Place
- KN:G-205 (Karlovo nám. 13, building G)
- Organizer
- Tomáš Werner
- Contact person
- Tomáš Werner, werner@cmp.felk.cvut.cz, +420-22435-5723
- More information
- http://cyber.felk.cvut.cz/seminars/?event=1112