| Fairness in recommendation ranking through pairwise comparisons A Beutel, J Chen, T Doshi, H Qian, L Wei, Y Wu, L Heldt, Z Zhao, L Hong, ... Proceedings of the 25th ACM SIGKDD international conference on knowledge …, 2019 | 460 | 2019 |
| Membership privacy: A unifying framework for privacy definitions N Li, W Qardaji, D Su, Y Wu, W Yang Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013 | 213 | 2013 |
| Agnostic learning of monomials by halfspaces is hard V Feldman, V Guruswami, P Raghavendra, Y Wu Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009 | 183 | 2009 |
| Optimal lower bounds for locality-sensitive hashing (except when q is tiny) R O’Donnell, Y Wu, Y Zhou ACM Transactions on Computation Theory (TOCT) 6 (1), 1-13, 2014 | 149 | 2014 |
| Data selection for speech recognition Y Wu, R Zhang, A Rudnicky 2007 IEEE Workshop on Automatic Speech Recognition & Understanding (ASRU …, 2007 | 87 | 2007 |
| An optimal SDP algorithm for Max-Cut, and equally optimal Long Code tests R O'Donnell, Y Wu Proceedings of the 40th annual ACM symposium on Theory of computing, 335-344, 2008 | 66 | 2008 |
| Fooling functions of halfspaces under product distributions P Gopalan, R O'Donnell, Y Wu, D Zuckerman 2010 IEEE 25th Annual Conference on Computational Complexity, 223-234, 2010 | 59 | 2010 |
| Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems A Ene, J Vondrák, Y Wu | 56 | 2012 |
| Conditional hardness for satisfiable 3-CSPs R O'Donnell, Y Wu Proceedings of the 41st annual ACM symposium on Theory of computing, 493-502, 2009 | 49 | 2009 |
| Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions I Diakonikolas, R O'Donnell, RA Servedio, Y Wu Proceedings of the Twenty-Second Annual ACM-SIAM, 2010 | 29 | 2010 |
| Optimal query complexity for estimating the trace of a matrix K Wimmer, Y Wu, P Zhang Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 28 | 2014 |
| 3-bit dictator testing: 1 vs. 5/8 R O'Donnell, Y Wu Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 22 | 2009 |
| A lower-variance randomized algorithm for approximate string matching MJ Atallah, E Grigorescu, Y Wu Information Processing Letters 113 (18), 690-692, 2013 | 20 | 2013 |
| Pricing loss leaders can be hard Y Wu Proc.2nd Innovation in Computer Science 1 (1), 2.3, 2011 | 17* | 2011 |
| Computational complexity of certifying restricted isometry property A Natarajan, Y Wu In Approximation, Randomization, and Combinatorial Optimization. Algorithms …, 2014 | 14 | 2014 |
| On the hardness of pricing loss-leaders P Popat, Y Wu Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 8 | 2012 |
| SDP gaps for 2-to-1 and other Label-Cover variants V Guruswami, S Khot, R O’Donnell, P Popat, M Tulsiani, Y Wu International Colloquium on Automata, Languages, and Programming, 617-628, 2010 | 6 | 2010 |
| Learned Ranking Function: From Short-term Behavior Predictions to Long-term User Satisfaction Y Wu, D Chang, J She, Z Zhao, L Wei, L Heldt Proceedings of the 18th ACM Conference on Recommender Systems, 1004-1009, 2024 | | 2024 |
| 低成本定价是难的 吴奕 计算机科学技术学报 27 (4), 718-726, 2012 | | 2012 |
| Approximability Results of CSPs and Learning Y Wu Carnegie Mellon University Pittsburgh, PA, 2010 | | 2010 |
Ryan O'DonnellProfessor, Computer Science Department, Carnegie MellonE-mailová adresa ověřena na: cs.cmu.edu
