Sciweavers

108 search results - page 7 / 22
» Efficiently solving convex relaxations for MAP estimation
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 3 days ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
CVPR
2007
IEEE
14 years 9 months ago
Two-View Motion Segmentation from Linear Programming Relaxation
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
Hongdong Li
ICML
2008
IEEE
14 years 8 months ago
A decoupled approach to exemplar-based unsupervised learning
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
Gökhan H. Bakir, Sebastian Nowozin
SIAMIS
2010
167views more  SIAMIS 2010»
13 years 2 months ago
Global Solutions of Variational Models with Convex Regularization
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
GLOBECOM
2008
IEEE
13 years 8 months ago
Energy Efficient Estimation of Gaussian Sources over Inhomogeneous Gaussian MAC Channels
In this paper, we first provide a joint source and channel coding (JSCC) approach in estimating Gaussian sources over Gaussian MAC channels, as well as its sufficient and necessary...
Shuangqing Wei, Rajgopal Kannan, S. Sitharama Iyen...