1272 search results - page 81 / 255 » The Set Cover with Pairs Problem |
201
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
138
click to vote
WILF
2009
Springer
16 years 7 days ago
2009
Springer
Measuring the similarity between clusterings is a classic problem with several proposed solutions. In this work we focus on measures based on coassociation of data pairs and perfor...
265
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
123
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
141
click to vote
ICMLA
2007
15 years 7 months ago
2007
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...