249 search results - page 13 / 50 » Geometry and the complexity of matrix multiplication |
FGCS
2008
13 years 9 months ago
2008
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
COMPGEOM
2011
ACM
13 years 16 days ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
PDCAT
2009
Springer
14 years 3 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...