Sciweavers

15485 search results - page 9 / 3097
» Computing Optimal Subsets
Sort
View
SC
2003
ACM
14 years 22 days ago
Optimizing Reduction Computations In a Distributed Environment
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
Tahsin M. Kurç, Feng Lee, Gagan Agrawal, &U...
AAAI
2008
13 years 9 months ago
Trace Ratio Criterion for Feature Selection
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...
Feiping Nie, Shiming Xiang, Yangqing Jia, Changshu...
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
13 years 11 months ago
Non-Standard Crossover for a Standard Representation - Commonality-Based Feature Subset Selection
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 ...
Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. ...
COMPGEOM
1998
ACM
13 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
SOFSEM
2012
Springer
12 years 3 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
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...
Peter Damaschke, Azam Sheikh Muhammad