Homin K. Lee, Ph.D. - Publications
Affiliations: | 2009 | Columbia University, New York, NY |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2011 | Jackson JC, Lee HK, Servedio RA, Wan A. Learning random monotone DNF Discrete Applied Mathematics. 159: 259-271. DOI: 10.1016/J.Dam.2010.08.022 | 0.586 | |||
2011 | Diakonikolas I, Lee HK, Matulef K, Servedio RA, Wan A. Efficiently testing sparse GF(2) polynomials Algorithmica (New York). 61: 580-605. DOI: 10.1007/S00453-010-9426-9 | 0.59 | |||
2008 | Dachman-Soled D, Lee HK, Malkin T, Servedio RA, Wan A, Wee H. Optimal cryptographic hardness of learning monotone functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 36-47. DOI: 10.4086/Toc.2009.V005A013 | 0.586 | |||
2007 | Lee HK, Servedio RA, Wan A. DNF are teachable in the average case Machine Learning. 69: 79-96. DOI: 10.1007/S10994-007-5007-9 | 0.566 | |||
Show low-probability matches. |