출판 All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis Edith Cohen ACM SIGMOD/PODS 2014, PODS 2014 | June 2014 Full version of ACM SIGMOD/PODS 2014 paper
출판 Mining Videos from the Web for Electronic Textbooks Rakesh Agrawal, Maria Chistofaraki, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi, Adith Swaminathan International Conference on Formal Concept Analysis (ICFCA) | June 2014
출판 A forward-backward single-source shortest paths algorithm David Wilson, Uri Zwick MSR-TR-2014-77 | June 2014
출판 Super-polynomial lower bounds for depth four homogeneous arithmetic formulas Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan Symposium on Theory of Computing (STOC) | June 2014
출판 A super-polynomial lower bound for regular arithmetic formulas. Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi Symposium on Theory of Computing (STOC) | June 2014 Symposium on Theory of Computing (STOC)
출판 Clustering in the Presence of Background Noise Shai Ben-David, Nika Haghtalab Proceedings of 31st International Conference in Machine Learning | June 2014
출판 FAST: A Transducer-Based Language for Tree Manipulation Margus Veanes, Benjamin Livshits, David Molnar, Ben Livshits PLDI 2014: Programming Language Design and Implementation | June 2014
출판 Bandits with concave rewards and convex knapsacks Shipra Agrawal, Nikhil Devanur EC 2014 | June 2014 EC 2014
출판 Analyze Gauss: Optimal Bounds For Privacy-Preserving PCA Cynthia Dwork, Kunal Talwar, Li Zhang, Abhradeep Thakurta STOC | June 2014 STOC
출판 Explicit Maximally Recoverable Codes with Locality Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin IEEE Transactions on Information Theory | June 2014