Dataflow Graphs as Matrices and Programming with Higher-order Matrix Elements.
Michael A. BukatinSteve MatthewsPublished in: CoRR (2016)
Keyphrases
- higher order
- eigenvalues and eigenvectors
- singular value decomposition
- coefficient matrix
- positive definite
- adjacency matrix
- graph transformation
- matrix representation
- perturbation theory
- square matrices
- singular values
- projection matrices
- block diagonal
- sparse matrix
- linear algebra
- linear complementarity problem
- graph matching
- data matrix
- covariance matrix
- positive semidefinite
- programming language
- high level language
- high order
- rows and columns
- symmetric positive definite
- low rank approximation
- affinity matrix
- kronecker product
- graph theory
- symmetric matrices
- systems of linear equations
- projection matrix
- control flow
- data flow
- measurement matrix
- parallel computing
- pseudo inverse
- graph representation
- covariance matrices
- distance matrix
- markov random field
- matrix completion
- totally unimodular
- lower order
- maximal cliques
- low rank and sparse
- matrix multiplication
- correlation matrix
- graph kernels
- kernel matrix
- design methodology
- pairwise
- spectral clustering
- kernel function
- similarity measure