353 citations · 1.8k across the 69 of their papers we have counts for
4 papers · 1 filter
Approximate fast graph Fourier transforms via multi-layer sparse approximations
Luc Le Magoarou, Rémi Gribonval, Nicolas Tremblay
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic…
Compressive K-means
Nicolas Keriven, Nicolas Tremblay, Yann Traonmilin +1
The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compres…
Approximate search with quantized sparse representations
Himalaya Jain, Patrick Pérez, Rémi Gribonval +2
This paper tackles the task of storing a large collection of vectors, such as visual descriptors, and of searching in it. To this end, we propose to approximate database vectors by…
Compressive Spectral Clustering
Nicolas Tremblay, Gilles Puy, Remi Gribonval +1
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to clust…