[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - The cell probe complexity of dynamic range counting

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Complexity of counting CSP with complex weights

✍ Cai, Jin-Yi; Chen, Xi 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 647 KB

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Linear vs. semidefinite extended formulations

✍ Fiorini, Samuel; Massar, Serge; Pokutta, Sebastian; Tiwary, Hans Raj; de Wolf, R 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 476 KB

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Nearly optimal sparse fourier transform

✍ Hassanieh, Haitham; Indyk, Piotr; Katabi, Dina; Price, Eric 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 761 KB

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Computing a nonnegative matrix factorization -- provably

✍ Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 858 KB

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Computing a nonnegative matrix factorization -- provably

✍ Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 858 KB

The Nonnegative Matrix Factorization (NMF) problem has a rich history spanning quantum mechanics, probability theory, data analysis, polyhedral combinatorics, communication complexity, demography, chemometrics, etc. In the past decade NMF has become enormously popular in machine learning, where the

[ACM Press the 44th symposium - New York

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Multiplying matrices faster than coppersmith-winograd

✍ Williams, Virginia Vassilevska 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 563 KB