Sciweavers

13 search results - page 2 / 3
» Grothendieck inequalities for semidefinite programs with ran...
Sort
View
BMCBI
2007
161views more  BMCBI 2007»
13 years 6 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 23 days ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
CVPR
2007
IEEE
14 years 8 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 3 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 22 days ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo