33 search results - page 7 / 7 » On the Positive-Negative Partial Set Cover problem |
TCS
2008
13 years 4 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
COMPGEOM
1994
ACM
13 years 8 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...