2109 search results - page 299 / 422 » Solving Necklace Constraint Problems |
147
Voted
AI
1999
Springer
15 years 4 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
134
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
147
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
Reliable estimation of the trifocal tensor is crucial for 3D reconstruction from uncalibrated cameras. The estimation process is based on minimizing the geometric distances betwee...
237
Voted
CP
2009
Springer
16 years 5 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
151
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...