Sciweavers

214 search results - page 27 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
SIAMIS
2011
13 years 2 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
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
ICCV
2009
IEEE
15 years 19 days ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
EUROGP
2006
Springer
138views Optimization» more  EUROGP 2006»
13 years 11 months ago
Evolving Crossover Operators for Function Optimization
Abstract. A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Pro...
Laura Diosan, Mihai Oltean
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou