The Expressive Power of Binary Submodular Functions
We investigate whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This question has been considered within several different contexts in computer science, including computer vision, artificial intelligence, an...
Главные авторы: | Zivny, S, Cohen, D, Jeavons, P |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2008
|
Схожие документы
Classes of Submodular Constraints Expressible by Graph Cuts
по: Živný, S, и др.
Опубликовано: (2008)
по: Živný, S, и др.
Опубликовано: (2008)
Схожие документы
-
The Expressive Power of Binary Submodular Functions
по: Zivny, S, и др.
Опубликовано: (2008) -
The Expressive Power of Binary Submodular Functions
по: Živný, S, и др.
Опубликовано: (2008) -
The Expressive Power of Binary Submodular Functions
по: Živný, S, и др.
Опубликовано: (2008) -
The Expressive Power of Binary Submodular Functions.
по: Zivny, S, и др.
Опубликовано: (2009) -
The Expressive Power of Binary Submodular Functions
по: Živný, S, и др.
Опубликовано: (2009)