Sciweavers

492 search results - page 55 / 99
» Perfect Matching Preservers
Sort
View
PG
2007
IEEE
15 years 6 months ago
Contour Correspondence via Ant Colony Optimization
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...
ISCAS
2003
IEEE
110views Hardware» more  ISCAS 2003»
15 years 5 months ago
Interconnect modeling and sensitivity analysis using adjoint networks reduction technique
An efficient model-order reduction technique for general RLC networks is proposed. The method is extended from the previous projection-base moment matching method with considerin...
Herng-Jer Lee, Chia-Chi Chu, Wu-Shiung Feng
ICIAP
2007
ACM
15 years 1 months ago
A New Stereo Algorithm Integrating Luminance, Gradient and Segmentation Informations in a Belief-Propagation Framework
The paper deals with the design and implementation of a stereo algorithm. Disparity map is formulated as a Markov Random Field with a new smoothness constraint depending not only ...
Nello Balossino, Maurizio Lucenteforte, Luca Piova...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 5 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
DAM
2007
107views more  DAM 2007»
14 years 12 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...