Sciweavers

108 search results - page 3 / 22
» Efficiently solving convex relaxations for MAP estimation
Sort
View
ICASSP
2008
IEEE
13 years 11 months ago
Blind channel estimation in MIMO-OFDM systems using semi-definite relaxation
A new blind channel estimation technique for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems is proposed. It estimates the channel pa...
Nima Sarmadi, Alex B. Gershman, Shahram Shahbazpan...
ICASSP
2010
IEEE
13 years 5 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ICCV
2005
IEEE
14 years 7 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
UAI
2008
13 years 6 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
ICML
2006
IEEE
14 years 6 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert