151 search results - page 6 / 31 » The max quasi-independent set Problem |
IPL
2008
13 years 8 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
GRC
2008
IEEE
13 years 9 months ago
2008
IEEE
Feature selection is an important problem for pattern classification systems. Mutual information is a good indicator of relevance between variables, and has been used as a measure...
JACM
1998
13 years 8 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 ...