68 search results - page 10 / 14 » Structured Low Rank Approximation of a Bezout Matrix |
ICC
2011
IEEE
12 years 9 months ago
2011
IEEE
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
SLSFS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
KDD
2012
ACM
12 years 7 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...