On The Efficiency of Sparse-Tiled Tensor Graph Processing For Low Memory Usage.
Antonio CipollettaAndrea CalimeraPublished in: DAC (2021)
Keyphrases
- memory usage
- high order
- memory footprint
- random walk
- high dimensional
- data processing
- low memory requirements
- real time
- graph theory
- gaussian graphical models
- directed graph
- graph theoretic
- graph matching
- tensor decomposition
- graph representation
- graph mining
- directed acyclic graph
- memory requirements
- structured data
- pairwise
- social networks