1469 search results - page 100 / 294 » Approximate polynomial decomposition |
SADM
2008
14 years 9 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
116
click to vote
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
TNN
2010
14 years 4 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
INFORMATICALT
2010
14 years 8 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...