1389 search results - page 29 / 278 » Improved Approximation Algorithms for Label Cover Problems |
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
115
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
107
click to vote
ICML
2005
IEEE
16 years 12 days ago
2005
IEEE
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
DATE
2000
IEEE
15 years 3 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...