![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Kevyn Collins-Thompson Kevyn Collins-Thompson, Jamie Callan : Query expansion using random walk models. CIKM 2005 : 704-711 Kevyn Collins-Thompson, James P. Callan : Predicting reading difficulty with statistical language models. JASIST 56 (13): 1448-1462 (2005) Kevyn Collins-Thompson, James P. Callan : A Language Modeling Approach to Predicting Reading Difficulty. HLT-NAACL 2004 : 193-200 Kevyn Collins-Thompson, Jamie Callan : Information retrieval for language tutoring: an overview of the REAP project. SIGIR 2004 : 544-545 Kevyn Collins-Thompson, Jamie Callan , Egidio L. Terra , Charles L. A. Clarke : The effect of document retrieval quality on factoid question answering performance. SIGIR 2004 : 574-575 Eric Nyberg , Teruko Mitamura , James P. Callan , Jaime G. Carbonell , Robert E. Frederking , Kevyn Collins-Thompson, Laurie Hiyakumoto , Yifen Huang , Curtis Huttenhower , Scott Judy , Jeongwoo Ko , Anna Kupsc , Lucian Vlad Lita , Vasco Pedro , David Svoboda , Benjamin Van Durme : The JAVELIN Question-Answering System at TREC 2003: A Multi-Strategh Approach with Dynamic Planning. TREC 2003 Kevyn Collins-Thompson, Paul Ogilvie , Yi Zhang , Jamie Callan : Information Filtering, Novelty Detection, and Named-Page Finding. TREC 2002 Eric Nyberg , Teruko Mitamura , Jaime G. Carbonell , James P. Callan , Kevyn Collins-Thompson, Krzysztof Czuba , Michael Duggan , Laurie Hiyakumoto , N. Hu , Yifen Huang , Jeongwoo Ko , Lucian Vlad Lita , S. Murtagh , Vasco Pedro , David Svoboda : The JAVELIN Question-Answering System at TREC 2002. TREC 2002 Kevyn Collins-Thompson, Charles Schweizer , Susan T. Dumais : Improved String Matching Under Noisy Channel Conditions. CIKM 2001 : 357-364 1 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] 2 [ 2 ] [ 4 ] 3 [ 5 ] 4 [ 2 ] 5 [ 2 ] 6 [ 1 ] 7 [ 4 ] 8 [ 4 ] 9 [ 2 ] [ 4 ] 10 [ 2 ] 11 [ 2 ] [ 4 ] 12 [ 4 ] 13 [ 4 ] 14 [ 2 ] [ 4 ] 15 [ 4 ] 16 [ 2 ] [ 4 ] 17 [ 2 ] [ 4 ] 18 [ 2 ] 19 [ 2 ] [ 4 ] 20 [ 3 ] 21 [ 2 ] [ 4 ] 22 [ 1 ] 23 [ 2 ] [ 4 ] 24 [ 5 ] 25 [ 3 ] ![]() ©2006 Association for Computing Machinery |