402 search results - page 72 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
SOFSEM
2007
Springer
14 years 25 days ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
CVPR
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
PAMI
2008
13 years 6 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
TOG
2002
13 years 6 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...