Sciweavers

843 search results - page 35 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
DAGSTUHL
2004
13 years 8 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
CEC
2008
IEEE
14 years 1 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
PAMI
2011
13 years 2 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 7 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 7 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier