64 search results - page 8 / 13 » Sparse Matrix Multiplication Using UPC |
JACM
2000
13 years 7 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
ICONIP
2007
13 years 9 months ago
2007
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...
CP
2003
Springer
14 years 24 days ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...