Sciweavers

64 search results - page 8 / 13
» Sparse Matrix Multiplication Using UPC
Sort
View
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A subdivision-based algorithm for the sparse resultant
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...
John F. Canny, Ioannis Z. Emiris
ICONIP
2007
14 years 11 months ago
Sparse Super Symmetric Tensor Factorization
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...
Andrzej Cichocki, Marko Jankovic, Rafal Zdunek, Sh...
CP
2003
Springer
15 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
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...
Steven David Prestwich, Desmond G. Higgins, Orla O...
CVPR
2007
IEEE
15 years 11 months ago
Nonnegative Tucker Decomposition
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
Yong-Deok Kim, Seungjin Choi
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Sparse Subspace Clustering
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 ...
Ehsan Elhamifar, René Vidal