1403 search results - page 64 / 281 » Set cover algorithms for very large datasets |
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
BMCBI
2005
14 years 9 months ago
2005
Background: Different classes of haplotype block algorithms exist and the ideal dataset to assess their performance would be to comprehensively re-sequence a large genomic region ...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
105
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...