English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Cooperative Cuts

Jegelka, S. (2011). Cooperative Cuts. Talk presented at COSA Workshop: Combinatorial Optimization, Statistics, and Applications. München, Germany. 2011-03-14 - 2011-03-15.

Item is

Files

show Files

Locators

show
hide
Description:
-

Creators

show
hide
 Creators:
Jegelka, S1, 2, Author              
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: Combinatorial problems with submodular cost functions have recently drawn interest. In a standard combinatorial problem, the sum-of-weights cost is replaced by a submodular set function. The result is a powerful model that is though very hard. In this talk, I will introduce cooperative cuts, minimum cuts with submodular edge weights. I will outline methods to approximately solve this problem, and show an application in computer vision. If time permits, the talk will also sketch regret-minimizing online algorithms for submodular-cost combinatorial problems. This is joint work with Jeff Bilmes (University of Washington).

Details

show
hide
Language(s):
 Dates: 2011-03
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Jegelka2011
 Degree: -

Event

show
hide
Title: COSA Workshop: Combinatorial Optimization, Statistics, and Applications
Place of Event: München, Germany
Start-/End Date: 2011-03-14 - 2011-03-15
Invited: Yes

Legal Case

show

Project information

show

Source

show