4903 search results - page 30 / 981 » The Set Covering Machine |
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Functional validation of a processor design through execution of a suite of test programs is common industrial practice. In this paper, we develop a high-level architectural speci...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
BMCBI
2006
2006
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
13 years 7 months ago
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
TCS
2008
13 years 7 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...