569 search results - page 28 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
IHI
2010
13 years 3 months ago
2010
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
TON
2008
13 years 8 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...