1.7k citations · 3.6k across the 34 of their papers we have counts for
4 papers · 1 filter
Functional correspondence by matrix completion
Artiom Kovnatsky, Michael M. Bronstein, Xavier Bresson +1
In this paper, we consider the problem of finding dense intrinsic correspondence between manifolds using the recently introduced functional framework. We pose the functional corres…
Consistency of Cheeger and Ratio Graph Cuts
Nicolas Garcia Trillos, Dejan Slepcev, James von Brecht +2
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measu…
Matrix Completion on Graphs
Vassilis Kalofolias, Xavier Bresson, Michael Bronstein +1
The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the proble…
An Incremental Reseeding Strategy for Clustering
Xavier Bresson, Huiyi Hu, Thomas Laurent +2
In this work we propose a simple and easily parallelizable algorithm for multiway graph partitioning. The algorithm alternates between three basic components: diffusing seed vertic…