401 search results - page 12 / 81 » Group-theoretic Algorithms for Matrix Multiplication |
FOCS
1992
IEEE
14 years 16 days ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
ICPADS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
ACL
1997
13 years 9 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
ICA
2007
Springer
14 years 9 days ago
2007
Springer
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....