![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. David Karger Jason D. Rennie , Lawrence Shih , Jaime Teevan , David Karger: Tackling the Poor Assumptions of Naive Bayes Text Classifiers. ICML 2003 : 616-623 Lawrence Shih , Jason Rennie , Yu-Han Chang , David Karger: Text Bundling: Statistics Based Data-Reduction. ICML 2003 : 696-703 Nick Feamster , Magdalena Balazinska , Winston Wang , Hari Balakrishnan , David Karger: Thwarting Web Censorship with Untrusted Messenger Discovery. Privacy Enhancing Technologies 2003 : 125-140 Jaime Teevan , David Karger: Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model. SIGIR 2003 : 18-25 Daniel W. Engels , David Karger, Stavros G. Kolliopoulos , Sudipta Sengupta , R. N. Uma , Joel Wein : Techniques for scheduling with rejection. J. Algorithms 49 (1): 175-191 (2003) David Karger, Nathan Srebro : Learning Markov networks: maximum bounded tree-width graphs. SODA 2001 : 392-401 Frank Dabek , M. Frans Kaashoek , David Karger, Robert Morris , Ion Stoica : Wide-Area Cooperative Storage with CFS. SOSP 2001 : 202-215 Raj Iyer , David Karger, Hariharan Rahul , Mikkel Thorup : An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. ACM Journal of Experimental Algorithms 6 : 4 (2001) 1 [ 6 ] 2 [ 6 ] 3 [ 7 ] 4 [ 2 ] 5 [ 4 ] 6 [ 6 ] 7 [ 1 ] 8 [ 2 ] 9 [ 4 ] 10 [ 2 ] 11 [ 1 ] 12 [ 7 ] 13 [ 8 ] 14 [ 4 ] 15 [ 7 ] [ 8 ] 16 [ 3 ] 17 [ 2 ] 18 [ 5 ] [ 8 ] 19 [ 1 ] 20 [ 4 ] 21 [ 6 ] 22 [ 4 ] ![]() ©2004 Association for Computing Machinery |