1403 search results - page 6 / 281 » Set cover algorithms for very large datasets |
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
BMCBI
2010
13 years 8 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
KDD
2008
ACM
14 years 8 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...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...