Login / Signup
A Case Study on Programming in a Paged Environment: An Implementation of Gustavson's fast Algorithm for Sparse Matrix Multiplication.
Jörg R. Mühlbacher
Published in:
Angew. Inform. (1980)
Keyphrases
</>
matrix multiplication
learning algorithm
path planning
detection algorithm
dynamic programming
computational complexity
worst case
mobile robot
np hard
k means
probabilistic model
search space
hardware implementation
input data
expectation maximization
sparse representation
preprocessing