1403 search results - page 23 / 281 » Set cover algorithms for very large datasets |
BMCBI
2008
13 years 8 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
JCO
2010
13 years 6 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ML
2008
ACM
13 years 8 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
CONCURRENCY
2002
13 years 8 months ago
2002
Parallel visualization of large datasets in GeoFEM is described. Our visualization subsystem supports concurrent visualization with computation, and outputs a simplified small gra...
DCC
2000
IEEE
14 years 26 days ago
2000
IEEE
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...