Search: in all items in current results
Select / remove query terms:
Found 1110 results in 0.048 sec. (Time to generate facets: 0 sec.)
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant: On the Learnability of Boolean Formulae STOC 1987
Cited 155 times
Michael J. Kearns, Ming Li: Learning in the Presence of Malicious Errors. SIAM J. Comput. (SIAMCOMP) 22(4):807-837 (1993)
Cited 135 times
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric. IEEE Transactions on Information Theory (TIT) 50(12):3250-3264 (2004)
Read article - Cited 86 times
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric. SODA 2003
Read article - Cited 86 times
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi: The similarity metric CoRR cs.CC/0111054(): (2001)
Read article - Cited 86 times
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li: Approximation Algorithms for Directed Steiner Problems. J. Algorithms (JAL) 33(1):73-91 (1999)
Cited 85 times
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li: Approximation Algorithms for Directed Steiner Problems. SODA 1998
Cited 85 times
Paul M. B. Vitányi, Ming Li: Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Transactions on Information Theory (TIT) 46(2):446-464 (2000)
Cited 49 times
Paul M. B. Vitányi, Ming Li: Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity CoRR cs.LG/9901014(): (1999)
Read article - Cited 49 times
J. Kevin Lanctot, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang: Distinguishing string selection problems. Inf. Comput. (IANDC) 185(1):41-55 (2003)
Read article - Cited 39 times
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Powered by Cloud Mining using the DBLP data.