Sciweavers

5331 search results - page 691 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 8 months ago
A time efficient Delaunay refinement algorithm
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
Gary L. Miller
AMC
2004
115views more  AMC 2004»
15 years 6 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
IJON
2002
128views more  IJON 2002»
15 years 6 months ago
Extraction of a source from multichannel data using sparse decomposition
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...
Michael Zibulevsky, Yehoshua Y. Zeevi
MVA
2007
142views Computer Vision» more  MVA 2007»
15 years 6 months ago
Shadow based texture registration for 3D modeling of outdoor scenes
This paper presents a novel method for the registration of texture images with a 3D model of outdoor scenes. We pose image registration as an optimization problem that uses knowled...
Alejandro Troccoli, Peter K. Allen
IJON
2008
133views more  IJON 2008»
15 years 5 months ago
A multi-objective approach to RBF network learning
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
Illya Kokshenev, Antônio de Pádua Bra...