Sciweavers

989 search results - page 16 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
JOI
2007
99views more  JOI 2007»
13 years 7 months ago
Measuring quality of similarity functions in approximate data matching
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
Roberto da Silva, Raquel Kolitski Stasiu, Viviane ...
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
13 years 11 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
ISLPED
1995
ACM
125views Hardware» more  ISLPED 1995»
13 years 11 months ago
Transforming set data types to power optimal data structures
In this paper we present a novel approach to model the search space for optimal set data types in network component realisations. The main objective is to arrive at power efficie...
Sven Wuytack, Francky Catthoor, Hugo De Man