— 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...
Ali Jadbabaie, Asuman E. Ozdaglar, Michael Zargham
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
The exponential growth of the web and the extended use of database management systems in widely distributed information systems has brought to the fore the need for seamless interc...
Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on ...
Stefano Mattoccia, Simone Giardino, Andrea Gambini