309 citations · 466 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DC2012★ 3 cited
Extending Task Parallelism for Frequent Pattern Mining
Prabhanjan Kambadur, Amol Ghoting, Anshul Gupta +1
Algorithms for frequent pattern mining, a popular informatics application, have unique requirements that are not met by any of the existing parallel tools. In particular, such appl…
stat.ML2012★ 127 cited
Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization
Abhishek Kumar, Vikas Sindhwani, Prabhanjan Kambadur
The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-c…