Abstract: We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While ...

Abstract: An efficient implicit representation of an n-vertex graph G in a family $\mathcal{F}$ of graphs assigns to each vertex of G a binary code of length O(log n) so that the adjacency between ...