NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks

14 August 2018

Papers citing "NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks"

7 / 7 papers shown

Title
Generalizing diffuse interface methods on graphs: non-smooth potentials and hypergraphs J. Bosch Steffen Klamt Martin Stoll 48 21 0 18 Nov 2016
The Little Engine that Could: Regularization by Denoising (RED) Yaniv Romano Michael Elad P. Milanfar DiffM 76 798 0 09 Nov 2016
Deep Convolutional Networks on Graph-Structured Data Mikael Henaff Joan Bruna Yann LeCun GNN 157 1,587 0 16 Jun 2015
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited Matthias Hein S. Setzer Leonardo Jost Syama Sundar Rangapuram 52 163 0 18 Dec 2013
Multiclass Data Segmentation using Diffuse Interface Methods on Graphs Cristina Garcia-Cardona Ekaterina Merkurjev Andrea L. Bertozzi A. Flenner A. Percus 53 118 0 15 Feb 2013
The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains D. Shuman S. K. Narang P. Frossard Antonio Ortega P. Vandergheynst 126 3,972 0 31 Oct 2012
A Tutorial on Spectral Clustering U. V. Luxburg 282 10,536 0 01 Nov 2007