485 search results - page 51 / 97 » Iterative Bounding LAO |
124
click to vote
CORR
2007
Springer
15 years 17 days ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
103
click to vote
HPCA
2006
IEEE
16 years 28 days ago
2006
IEEE
Processor architects have a challenging task of evaluating a large design space consisting of several interacting parameters and optimizations. In order to assist architects in ma...
95
Voted
3DIM
2007
IEEE
15 years 7 months ago
2007
IEEE
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
115
Voted
GLVLSI
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...