Sciweavers

5331 search results - page 326 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 8 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
CPAIOR
2010
Springer
15 years 10 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
TSP
2008
100views more  TSP 2008»
15 years 6 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III
SWARM
2010
SPRINGER
231views Optimization» more  SWARM 2010»
15 years 11 months ago
Hybrid Particle Swarm and Conjugate Gradient Optimization Algorithm
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
Abdallah Qteish, Mohammad Hamdan
ICCAD
1998
IEEE
81views Hardware» more  ICCAD 1998»
15 years 11 months ago
A simultaneous routing tree construction and fanout optimization algorithm
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Amir H. Salek, Jinan Lou, Massoud Pedram