Sciweavers

401 search results - page 6 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Regularized split gradient method for nonnegative matrix factorization
This article deals with a regularized version of the split gradient method (SGM), leading to multiplicative algorithms. The proposed algorithm is available for the optimization of...
Henri Lantéri, Céline Theys, C&eacut...
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
15 years 4 months ago
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Brice Boyer, Jean-Guillaume Dumas, Clément ...
SODA
1996
ACM
138views Algorithms» more  SODA 1996»
14 years 10 months ago
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
Donald Aingworth, Chandra Chekuri, Rajeev Motwani
ICASSP
2009
IEEE
14 years 7 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi
65
Voted
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 2 months ago
Maximum Matchings in Planar Graphs via Gaussian Elimination
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
Marcin Mucha, Piotr Sankowski