Sciweavers

652 search results - page 48 / 131
» Linear Explicit Substitutions
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 8 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
MOC
2002
108views more  MOC 2002»
13 years 8 months ago
Newton-like method with modification of the right-hand-side vector
This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate, while the correction is performed on...
Natasa Krejic, Zorana Luzanin
ISCAS
2002
IEEE
130views Hardware» more  ISCAS 2002»
14 years 1 months ago
Analysis of limit cycle stability in a tap-changing transformer
The paper analyses the nature of limit cycles induced through the interaction of transformer tap changing and load dynamics. Linearization of a Poincar´e map is used to prove loc...
Vaibhav Donde, Ian A. Hiskens
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 8 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
13 years 10 months ago
An LP-based methodology for improved timing-driven placement
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
Qingzhou (Ben) Wang, John Lillis, Shubhankar Sanya...