Dec 28, 2014 · This is the first data structure achieving a sub-quadratic dependence on \epsilon. Our work builds upon recent work of Andoni, Krauthgamer ...
This work builds upon recent work of Andoni, Krauthgamer, and Woodruff who showed that $\tilde{O}(n \epsilon^{-1})$ bits of space is possible for preserving ...
Dec 28, 2014 · Abstract. We study the problem of compressing a weighted graph G on n vertices, building a “sketch” H of G, so that given any vector x ∈ Rn ...
This is the first data structure achieving a sub-quadratic dependence on $\epsilon$. Our work builds upon recent work of Andoni, Krauthgamer, and Woodruff who ...
Duration: 58:29
Posted: Jun 3, 2014
Posted: Jun 3, 2014
1. Can we do better than incremental sparsification ? 2. Is there a parallel sparsification algorithm? 3. Is there a distributed sparsification algorithm ?
... Algorithm for Spectral Graph Sparsification (by Jiecao Chen, Bo Qin, David P. ... We study the problem of sketching an input graph, so that given the sketch, one ...
We develop a framework for graph sparsification and sketching, based on a new tool, short cycle decomposition, which is a decomposition of an unweighted ...
We show existence and efficient algorithms for constructing graphical spectral sketches - a distribution over sparse graphs H with about nε -1 edges such ...
Graph sparsification is the approximation of an arbitrary graph by a sparse graph. We explain what it means for one graph to be a spectral approximation of ...
Missing: Sketching | Show results with:Sketching