840 search results - page 111 / 168 » Inapproximability of Combinatorial Optimization Problems |
SCALESPACE
2009
Springer
15 years 7 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
115
click to vote
ACML
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
104
click to vote
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
100
click to vote
NIPS
2007
15 years 1 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
117
click to vote
CATS
2006
15 years 1 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...