ML Anthology

A Nearly-Linear Time Framework for Graph-Structured Sparsity

Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
IJCAI 2016 pp. 4165-4169
/ijcai/2016/hegde2016ijcai-nearly/
IJCAI Semantic Scholar

Cite

Text

Hegde et al. "A Nearly-Linear Time Framework for Graph-Structured Sparsity." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Hegde et al. "A Nearly-Linear Time Framework for Graph-Structured Sparsity." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/hegde2016ijcai-nearly/)

BibTeX

@inproceedings{hegde2016ijcai-nearly,
  title     = {{A Nearly-Linear Time Framework for Graph-Structured Sparsity}},
  author    = {Hegde, Chinmay and Indyk, Piotr and Schmidt, Ludwig},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4165-4169},
  url       = {https://mlanthology.org/ijcai/2016/hegde2016ijcai-nearly/}
}