1403 search results - page 29 / 281 » Set cover algorithms for very large datasets |
IJCAI
2003
13 years 9 months ago
2003
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
DLT
2006
13 years 9 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
APWEB
2005
Springer
14 years 2 months ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...