Sciweavers

299 search results - page 15 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
TCOM
2010
92views more  TCOM 2010»
13 years 6 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
ICML
2010
IEEE
13 years 8 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
13 years 7 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
ISVC
2005
Springer
14 years 1 months ago
A Vectorial Self-dual Morphological Filter Based on Total Variation Minimization
We present a vectorial self dual morphological filter. Contrary to many methods, our approach does not require the use of an ordering on vectors. It relies on the minimization of ...
Jérôme Darbon, Sylvain Peyronnet
SC
2003
ACM
14 years 29 days ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis