1. Daniel Alfsmann. 2006. On families of 2 N-dimensional hypercomplex algebras suitable for digital signal processing. In EUSIPCO. 1–4. Daniel Alfsmann. 2006. On families of 2 N-dimensional hypercomplex algebras suitable for digital signal processing. In EUSIPCO. 1–4.
2. John Baez . 2002. The octonions. Bulletin of the american mathematical society 39, 2 ( 2002 ), 145–205. John Baez. 2002. The octonions. Bulletin of the american mathematical society 39, 2 (2002), 145–205.
3. Rianne van den Berg Thomas N Kipf and Max Welling. 2017. Graph convolutional matrix completion. In KDD. Rianne van den Berg Thomas N Kipf and Max Welling. 2017. Graph convolutional matrix completion. In KDD.
4. Jiangxia Cao Xixun Lin Shu Guo Luchen Liu Tingwen Liu and Bin Wang. 2021. Bipartite graph embedding via mutual information maximization. In WSDM. 635–643. Jiangxia Cao Xixun Lin Shu Guo Luchen Liu Tingwen Liu and Bin Wang. 2021. Bipartite graph embedding via mutual information maximization. In WSDM. 635–643.
5. Jie Chen Tengfei Ma and Cao Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. In ICLR. Jie Chen Tengfei Ma and Cao Xiao. 2018. Fastgcn: fast learning with graph convolutional networks via importance sampling. In ICLR.