Sciweavers

2657 search results - page 120 / 532
» On the complexity of hierarchical problem solving
Sort
View
COR
2008
111views more  COR 2008»
15 years 1 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
CVPR
2005
IEEE
15 years 3 months ago
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
Bogdan Georgescu, Xiang Sean Zhou, Dorin Comaniciu...
PAMI
2011
14 years 4 months ago
Decomposition of Complex Line Drawings with Hidden Lines for 3D Planar-Faced Manifold Object Reconstruction
—3D object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail ...
Jianzhuang Liu, Yu Chen, Xiaoou Tang
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 5 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
ICCV
2007
IEEE
16 years 3 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...