1279 search results - page 133 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
SMI
2006
IEEE
14 years 3 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...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
ESANN
2001
13 years 10 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...