1403 search results - page 99 / 281 » Set cover algorithms for very large datasets |
120
click to vote
TCAD
1998
15 years 4 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
123
click to vote
RECOMB
2003
Springer
16 years 4 months ago
2003
Springer
Critical to the understanding of the genetic basis for complex diseases is the modeling of human variation. Most of this variation can be characterized by single nucleotide polymo...
143
click to vote
VISUALIZATION
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users wit...
135
click to vote
DAGM
2008
Springer
15 years 6 months ago
2008
Springer
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
130
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...