Sciweavers

36 search results - page 5 / 8
» Solving convex programs by random walks
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 1 months ago
Parameter estimation with expected and residual-at-risk criteria
In this paper we study a class of uncertain linear estimation problems in which the data are affected by random uncertainty. In this setting, we consider two estimation criteria,...
Giuseppe Carlo Calafiore, Ufuk Topcu, Laurent El G...
ECCV
2000
Springer
14 years 9 months ago
Model Based Pose Estimator Using Linear-Programming
Given a ? object and some measurements for points in this object, it is desired to find the ? location of the object. A new model based pose estimator from stereo pairs based on l...
Moshe Ben-Ezra, Shmuel Peleg, Michael Werman
DAC
2005
ACM
14 years 8 months ago
Robust gate sizing by geometric programming
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
Jaskirat Singh, Vidyasagar Nookala, Zhi-Quan Luo, ...
TCAD
2008
136views more  TCAD 2008»
13 years 7 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 2 months 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