1272 search results - page 81 / 255 » The Set Cover with Pairs Problem |
132
Voted
SODA
2012
ACM
13 years 3 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...
93
Voted
WILF
2009
Springer
15 years 7 months 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...
185
Voted
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...
83
Voted
TPHOL
2003
IEEE
15 years 6 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...
ICMLA
2007
15 years 2 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...