Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing

DOI10.1137/1.9781611975994.8OpenAlexW4229674350MaRDI QIDQ5146769

Chiranjib Bhattacharyya, Ravindran Kannan

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.06738

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Smoothed separable nonnegative matrix factorization

This page was built for publication: Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing