15485 search results - page 13 / 3097 » Computing Optimal Subsets |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
HEURISTICS
1998
13 years 7 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...