3422 search results - page 12 / 685 » Random Subset Optimization |
RSA
1998
14 years 11 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
106
click to vote
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...
123
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...