Sciweavers

4432 search results - page 245 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
127
Voted
ICIP
2000
IEEE
16 years 5 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 7 months ago
Heterogeneous cooperative coevolution: strategies of integration between GP and GA
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsec...
ICCD
2004
IEEE
106views Hardware» more  ICCD 2004»
16 years 22 days ago
A New Statistical Optimization Algorithm for Gate Sizing
— In this paper, we approach the gate sizing problem in VLSI circuits in the context of increasing variability of process and circuit parameters as technology scales into the nan...
Murari Mani, Michael Orshansky
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 10 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier