67 search results - page 5 / 14 » Local versus Global Search in Channel Graphs |
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
127
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
104
click to vote
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...