2636 search results - page 309 / 528 » Linear Programming |
133
click to vote
KR
1992
Springer
15 years 7 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
141
Voted
CVPR
2009
IEEE
15 years 7 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
153
Voted
VLSID
2010
IEEE
15 years 7 months ago
2010
IEEE
A novel design approach for simultaneous power and stability (static noise margin, SNM) optimization of nanoCMOS static random access memory (SRAM) is presented. A 45nm single-end...
128
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract--Power-awareness in networking attracts more attention as the trends in the energy consumption of the Internet raise growing concerns about the environmental impacts and s...
130
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...