1322 search results - page 89 / 265 » Parameterized counting problems |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
AAAI
2006
13 years 10 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
ICANN
2009
Springer
14 years 1 months ago
2009
Springer
Recent research has shown that the provisional count of votes of an ensemble of classifiers can be used to estimate the probability that the final ensemble prediction coincides w...