Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm.
Brice BoyerJean-Guillaume DumasClément PernetWei ZhouPublished in: ISSAC (2009)
Keyphrases
- memory efficient
- matrix multiplication
- dynamic programming
- simulated annealing
- optimal solution
- computational complexity
- learning algorithm
- three dimensional
- iterative deepening
- objective function
- preprocessing
- k means
- integral image
- np hard
- parallel machines
- image matching
- matching algorithm
- similarity measure
- image segmentation