46 search results - page 1 / 10 » Parallel and Distributed Graph Cuts by Dual Decomposition |
63
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
90
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
APPT
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
108
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...