Sciweavers

244 search results - page 2 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
TSP
2008
115views more  TSP 2008»
13 years 7 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
ICCV
2011
IEEE
12 years 7 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
ICCV
2007
IEEE
14 years 1 months ago
Two-View Motion Segmentation by Mixtures of Dirichlet Process with Model Selection and Outlier Removal
This paper presents a novel motion segmentation algorithm on the basis of mixture of Dirichlet process (MDP) models, a kind of nonparametric Bayesian framework. In contrast to pre...
Yong-Dian Jian, Chu-Song Chen
FOCS
2006
IEEE
14 years 1 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko