Publication
A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain
Publications associées (76)
Finding Perfect Matchings in Bipartite Hypergraphs
Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perf ...
SPRINGER HEIDELBERG2018MATHICSE Technical Report : A fast spectral divide-and-conquer method for banded matrices
Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Higham [SIAM J. Sci. Comput., 35(3):A1325{A1349, 2013], we propose a new algorithm for computing all the eigenvalues and eigenvectors of a symmetric banded matrix. For this purpose, we c ...
MATHICSE2018Rake, Peel, Sketch
The prototypical signal processing pipeline can be divided into four blocks. Representation of the signal in a basis suitable for processing. Enhancement of the meaningful part of the signal and noise reduction. Estimation of important statistical properti ...
EPFL2017The weighted stable matching problem
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general ...
2017An Adaptive Sublinear-Time Block Sparse Fourier Transform
Volkan Cevher, Mikhail Kapralov, Jonathan Mark Scarlett, Amir Zandieh
The problem of approximately computing the dominant Fourier coefficients of a vector quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in ...
2017Extension complexity of stable set polytopes of bipartite graphs
Yuri Faenza, Manuel Francesco Aprile
The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...
Springer2017Recompression Of Hadamard Products Of Tensors In Tucker Format
The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on lo ...
Siam Publications2017A semi-algebraic version of Zarankiewicz's problem
A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...
European Mathematical Soc2017Polarization of the Renyi Information Dimension With Applications to Compressed Sensing
Emmanuel Abbé, Saeid Haghighatshoar
In this paper, we show that the Hadamard matrix acts as an extractor over the reals of the Renyi Information Dimension (RID), in an analogous way to how it acts as an extractor of the discrete entropy over finite fields. More precisely, we prove that the R ...
Ieee-Inst Electrical Electronics Engineers Inc2017Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices
The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based on Gaussian appr ...
2016