Sciweavers

4432 search results - page 52 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
AUTOMATICA
2004
128views more  AUTOMATICA 2004»
13 years 9 months ago
A convex optimization approach to the mode acceleration problem
The purpose of this note is to introduce an alternative procedure to the mode acceleration method when the underlying structure model includes damping. We will show that the probl...
S. O. Reza Moheimani, Dunant Halim
ICASSP
2007
IEEE
14 years 4 months ago
Multiple View Region Matching as a Lagrangian Optimization Problem
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
Felipe Calderero, Ferran Marqués, Antonio O...
IPPS
2007
IEEE
14 years 4 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
MOC
2002
101views more  MOC 2002»
13 years 9 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
MOR
2010
91views more  MOR 2010»
13 years 8 months ago
On the One-Dimensional Optimal Switching Problem
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
Erhan Bayraktar, Masahiko Egami