English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Online algorithms for submodular minimization with combinatorial constraints

Jegelka, S., & Bilmes, J. (2010). Online algorithms for submodular minimization with combinatorial constraints. In NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML) (pp. 1-6).

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Jegelka, S1, Author           
Bilmes, J1, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

show
hide
Free keywords: -
 Abstract: Building on recent results for submodular minimization with combinatorial constraints, and on online submodular minimization, we address online approximation algorithms for submodular minimization with combinatorial constraints. We discuss two types of algorithms and outline approximation algorithms that integrate into those.

Details

show
hide
Language(s):
 Dates: 2010-12
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: URI: http://www.discml.cc/
BibTex Citekey: JegelkaB2010
 Degree: -

Event

show
hide
Title: NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML)
Place of Event: Whistler, BC, Canada
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 6 Identifier: -