Sciweavers

401 search results - page 13 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
ICASSP
2011
IEEE
13 years 5 days ago
Novel hierarchical ALS algorithm for nonnegative tensor factorization
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
Anh Huy Phan, Andrzej Cichocki, Kiyotoshi Matsuoka...
EUROPAR
2009
Springer
14 years 3 months ago
High Performance Matrix Multiplication on Many Cores
Moore’s Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level par...
Nan Yuan, Yongbin Zhou, Guangming Tan, Junchao Zha...
CHI
2009
ACM
14 years 9 months ago
EnsembleMatrix: interactive visualization to support machine learning with multiple classifiers
Machine learning is an increasingly used computational tool within human-computer interaction research. While most researchers currently utilize an iterative approach to refining ...
Justin Talbot, Bongshin Lee, Ashish Kapoor, Desney...
SIAMMAX
2010
104views more  SIAMMAX 2010»
13 years 3 months ago
Rigorous Perturbation Bounds of Some Matrix Factorizations
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
Xiao-Wen Chang, Damien Stehlé