452 search results - page 13 / 91 » A convex optimization approach to the mode acceleration prob... |
117
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
114
click to vote
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
150
click to vote
WSC
2008
15 years 3 months ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
129
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
112
click to vote
HSNMC
2004
Springer
15 years 6 months ago
2004
Springer
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...