9842 search results - page 62 / 1969 » The Complexity of the Matching-Cut Problem |
APLAS
2008
ACM
13 years 9 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
NIPS
2007
13 years 9 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
IS
2008
13 years 7 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
SIAMCOMP
2008
13 years 7 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...