![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ben Carterette Ben Carterette, James Allan : Incremental test collections. CIKM 2005 : 680-687 James Allan , Ben Carterette, Joshua Lewis : When will information retrieval be "good enough"? SIGIR 2005 : 433-440 Ben Carterette, Fazli Can : Comparing inverted files and signature files for searching a large lexicon. Inf. Process. Manage. 41 (3): 613-633 (2005) 1 [ 2 ] [ 3 ] 2 [ 1 ] 3 [ 2 ] ![]() ©2006 Association for Computing Machinery |