Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network.
Raghavendra KanakagiriEdgar SolomonikPublished in: SPAA (2024)
Keyphrases
- minimum cost
- network flow
- network flow problem
- tensor decomposition
- high order
- spanning tree
- np hard
- approximation algorithms
- tensor factorization
- capacity constraints
- diffusion tensor
- complex networks
- dimensionality reduction
- link prediction
- minimum cost flow
- high dimensional
- network design problem
- undirected graph
- magnetic resonance images
- special case