Yi Wu
Yi Wu
Verified email at
Cited by
Cited by
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
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
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
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
Data selection for speech recognition
Y Wu, R Zhang, A Rudnicky
2007 IEEE Workshop on Automatic Speech Recognition & Understanding (ASRU†…, 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
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
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
A Ene, J VondrŠk, Y Wu
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
Comparison of the carbon isotope composition of total organic carbon and long-chain n-alkanes from surface soils in eastern China and their significance
ZG Rao, GD Jia, ZY Zhu, Y Wu, JW Zhang
Chinese Science Bulletin 53 (24), 3921-3927, 2008
Optimal lower bounds for locality sensitive hashing (except when q is tiny)
R O'Donnell, Y Wu, Y Zhou
arXiv preprint arXiv:0912.0250, 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
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
3-bit dictator testing: 1 vs. 5/8
R O'Donnell, Y Wu
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete†…, 2009
A lower-variance randomized algorithm for approximate string matching
MJ Atallah, E Grigorescu, Y Wu
Information Processing Letters 113 (18), 690-692, 2013
Pricing loss leaders can be hard
Y Wu
Proc.2nd Innovation in Computer Science 1 (1), 2.3, 2011
Computational complexity of certifying restricted isometry property
A Natarajan, Y Wu
arXiv preprint arXiv:1406.5791, 2014
On the hardness of pricing loss-leaders
P Popat, Y Wu
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete†…, 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
计算机科学技术学报 27 (4), 718-726, 2012
The system can't perform the operation now. Try again later.
Articles 1–20