Sciweavers

3250 search results - page 239 / 650
» An Algorithm to Solve a Linear Program
Sort
View
JMLR
2012
13 years 9 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
CDC
2010
IEEE
101views Control Systems» more  CDC 2010»
15 years 1 months ago
Identification of mixed linear/nonlinear state-space models
The primary contribution of this paper is an algorithm capable of identifying parameters in certain mixed linear/nonlinear state-space models, containing conditionally linear Gauss...
Fredrik Lindsten, Thomas B. Schön
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
15 years 12 months ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...
DAC
2002
ACM
16 years 7 months ago
ILP-based engineering change
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...
TON
2010
147views more  TON 2010»
15 years 4 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz