BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
graph (9)
algorithm (4)
time (2)
scalabl (2)
limit (2)

Stem sparsif$ (all stems)

19 papers:

DACDAC-2015-HanF #analysis #approach #cpu #gpu #graph #scalability
Transient-simulation guided graph sparsification approach to scalable harmonic balance (HB) analysis of post-layout RF circuits leveraging heterogeneous CPU-GPU computing systems (LH, ZF), p. 6.
STOCSTOC-2015-ZhuLO #matrix #multi
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (ZAZ, ZL, LO), pp. 237–245.
ICMLICML-c3-2013-Cho #image
Simple Sparsification Improves Sparse Denoising Autoencoders in Denoising Highly Corrupted Images (KC), pp. 432–440.
PODSPODS-2012-AhnGM #graph #sketching
Graph sketches: sparsification, spanners, and subgraphs (KJA, SG, AM), pp. 5–14.
ICALPICALP-v1-2012-SanthanamS #on the
On the Limits of Sparsification (RS, SS), pp. 774–785.
ICMLICML-2012-SunGS #kernel #on the #online #taxonomy
On the Size of the Online Kernel Sparsification Dictionary (YS, FJG, JS), p. 79.
ICPRICPR-2012-RaketN #algorithm
A splitting algorithm for directional regularization and sparsification (LLR, MN), pp. 3094–3098.
SIGMODSIGMOD-2011-SatuluriPR #clustering #graph #scalability
Local graph sparsification for scalable clustering (VS, SP, YR), pp. 721–732.
STOCSTOC-2011-FungHHP #framework #graph
A general framework for graph sparsification (WSF, RH, NJAH, DP), pp. 71–80.
KDDKDD-2011-MathioudakisBCGU #network
Sparsification of influence networks (MM, FB, CC, AG, AU), pp. 529–537.
STOCSTOC-2010-DellM #polynomial #satisfiability
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
Subgraph sparsification and nearly optimal ultrasparsifiers (AK, YM, AS, SHT), pp. 57–66.
Extensions and limits to vertex sparsification (FTL, AM), pp. 47–56.
ICALPICALP-v2-2009-AhnG #graph
Graph Sparsification in the Semi-streaming Model (KJA, SG), pp. 328–338.
ICMLICML-2009-GargK #algorithm #strict
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property (RG, RK), pp. 337–344.
STOCSTOC-2008-SpielmanS #effectiveness #graph
Graph sparsification by effective resistances (DAS, NS), pp. 563–568.
STOCSTOC-2004-SpielmanT #algorithm #clustering #graph #linear
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
DACDAC-2000-KanapkaPW #performance
Fast methods for extraction and sparsification of substrate coupling (JK, JRP, JW), pp. 738–743.
STOCSTOC-1993-EppsteinGIS #algorithm #graph
Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.