Sciweavers

46 search results - page 3 / 10
» On linear and semidefinite programming relaxations for hyper...
Sort
View
TSP
2010
13 years 1 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
ICCV
2011
IEEE
12 years 6 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
SIAMJO
2011
13 years 22 days ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
CDC
2010
IEEE
124views Control Systems» more  CDC 2010»
13 years 1 months ago
A relaxation of Lyapunov conditions and controller synthesis for discrete-time periodic systems
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
Christoph Bohm, Mircea Lazar, Frank Allgöwer
NIPS
2007
13 years 7 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...