4131 search results - page 63 / 827 » The Generalized Max-Controlled Set Problem |
130
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
113
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
138
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
195
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
128
click to vote
JMLR
2008
15 years 2 months ago
2008
In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new cl...