1389 search results - page 112 / 278 » Improved Approximation Algorithms for Label Cover Problems |
132
click to vote
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
168
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
122
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
137
click to vote
PRICAI
2010
Springer
15 years 1 months ago
2010
Springer
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
124
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...