251 search results - page 22 / 51 » Distributed subgradient projection algorithm for convex opti... |
134
Voted
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
146
click to vote
INFOCOM
2010
IEEE
15 years 10 days ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
121
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
110
click to vote
SIAMSC
2008
15 years 2 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
143
click to vote
PR
2006
15 years 2 months ago
2006
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...