15485 search results - page 9 / 3097 » Computing Optimal Subsets |
SC
2003
ACM
15 years 2 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
102
click to vote
AAAI
2008
14 years 12 months ago
2008
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
GECCO
1999
Springer
15 years 1 months ago
1999
Springer
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
SOFSEM
2012
Springer
13 years 5 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...