16404 search results - page 160 / 3281 » A set coverage problem |
APAL
2007
15 years 3 months ago
2007
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
156
Voted
SCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
128
Voted
JACM
1998
15 years 3 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
120
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
126
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...