<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Operations research / Parallel computing / Numerical linear algebra / Matrix multiplication algorithm / Shortest path problem / Matrix multiplication / FloydWarshall algorithm / Algorithm / Dynamic programming / Linear programming
Date: 2014-05-27 23:58:32
Mathematics
Algebra
Operations research
Parallel computing
Numerical linear algebra
Matrix multiplication algorithm
Shortest path problem
Matrix multiplication
FloydWarshall algorithm
Algorithm
Dynamic programming
Linear programming

Add to Reading List

Source URL: gauss.cs.ucsb.edu

Download Document from Source Website

File Size: 256,26 KB

Share Document on Facebook

Similar Documents

Mathematics / Algebra / Exponentials / Matrix theory / IP / Summation / Exponentiation

COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler

DocID: 1xUI5 - View Document

Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´

DocID: 1vrNt - View Document

2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama

DocID: 1uUeI - View Document

0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University

DocID: 1uMPm - View Document

Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C

DocID: 1uzWI - View Document