478 search results - page 63 / 96 » Approximation algorithms for general packing problems and th... |
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
SMI
2006
IEEE
14 years 2 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...