Sciweavers

2816 search results - page 34 / 564
» Submodular function minimization
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
EMMCVPR
2011
Springer
12 years 10 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ECCV
2004
Springer
15 years 26 days ago
Weighted Minimal Hypersurfaces and Their Applications in Computer Vision
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
Bastian Goldlücke, Marcus A. Magnor
SIAMCO
2008
70views more  SIAMCO 2008»
13 years 11 months ago
Minimal Time Sequential Batch Reactors with Bounded and Impulse Controls for One or More Species
We consider the optimal control problem of feeding in minimal time a tank where several species compete for a single resource, with the objective being to reach a given level of th...
Pedro Gajardo, Héctor Ramírez Cabrer...
MICAI
2007
Springer
14 years 5 months ago
On Reachability of Minimal Models of Multilattice-Based Logic Programs
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...