Sciweavers

6562 search results - page 12 / 1313
» Noetherianity and Combination Problems
Sort
View
EMMCVPR
2011
Springer
12 years 9 months ago
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Thomas Schoenemann, Yubin Kuang, Fredrik Kahl
MLDM
2009
Springer
14 years 4 months ago
Dynamic Score Combination: A Supervised and Unsupervised Score Combination Method
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
Roberto Tronci, Giorgio Giacinto, Fabio Roli
JCAM
2010
139views more  JCAM 2010»
13 years 4 months ago
A finite difference method for free boundary problems
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
Bengt Fornberg
ICCV
2011
IEEE
12 years 9 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
JDA
2010
122views more  JDA 2010»
13 years 4 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos