451 search results - page 56 / 91 » Simulated Annealing for Convex Optimization |
166
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
126
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
183
Voted
ICIAP
2005
ACM
15 years 9 months ago
2005
ACM
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
188
click to vote
CVPR
2009
IEEE
16 years 2 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
163
Voted
IEEEPACT
2008
IEEE
15 years 10 months ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...