666 search results - page 59 / 134 » The Pipelined Set Cover Problem |
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
FGR
2004
IEEE
14 years 1 months ago
2004
IEEE
Data collection for both training and testing a classifier is a tedious but essential step towards face detection and recognition. All of the statistical methods suffer from this ...
BMCBI
2008
13 years 10 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
SIAMCOMP
1998
13 years 9 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...