Sciweavers

1090 search results - page 67 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
3DIM
2005
IEEE
14 years 3 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...
PAMI
1998
107views more  PAMI 1998»
13 years 10 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
ASPDAC
1998
ACM
79views Hardware» more  ASPDAC 1998»
14 years 2 months ago
Simultaneous Wire Sizing and Wire Spacing in Post-Layout Performance Optimization
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
Jiang-An He, Hideaki Kobayashi
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 9 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 3 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...