![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Vassilis Plachouras Iadh Ounis , Gianni Amati , Vassilis Plachouras, Ben He , Craig Macdonald , Douglas Johnson : Terrier Information Retrieval Platform. ECIR 2005 : 517-519 Fidel Cacheda , Victor Carneiro , Vassilis Plachouras, Iadh Ounis : Network Analysis for Distributed Information Retrieval Architectures. ECIR 2005 : 527-529 Fidel Cacheda , Vassilis Plachouras, Iadh Ounis : A case study of distributed information retrieval architectures to index one terabyte of text. Inf. Process. Manage. 41 (5): 1141-1161 (2005) Vassilis Plachouras, Iadh Ounis : Dempster-Shafer Theory for a Query-Biased Combination of Evidence on the Web. Inf. Retr. 8 (2): 197-218 (2005) Fidel Cacheda , Vassilis Plachouras, Iadh Ounis : Performance Analysis of Distributed Architectures to Index One Terabyte of Text. ECIR 2004 : 394-408 Vassilis Plachouras, Iadh Ounis : Usefulness of hyperlink structure for query-biased topic distillation. SIGIR 2004 : 448-455 Vassilis Plachouras, Iadh Ounis : Distribution of relevant documents in domain-level aggregates for topic distillation. WWW (Alternate Track Papers & Posters) 2004 : 372-373 Vassilis Plachouras, Iadh Ounis : Information Theoretic Query Context Detection for Web Information Retrieval. ICWI 2003 : 977-980 Vassilis Plachouras, Iadh Ounis , Gianni Amati : A Utility-Oriented Hyperlink Analysis Model for the Web. LA-WEB 2003 : 123-131 Vassilis Plachouras, Iadh Ounis , Cornelis Joost van Rijsbergen , Fidel Cacheda : University of Glasgow at the Web Track: Dynamic Application of Hyperlink Analysis using the Query Scope. TREC 2003 : 646-652 Vassilis Plachouras, Iadh Ounis , Gianni Amati , C. J. van Rijsbergen : University of Glasgow at the Web Track of TREC 2002. TREC 2002 1 [ 1 ] [ 3 ] [ 11 ] 2 [ 2 ] [ 7 ] [ 9 ] [ 10 ] 3 [ 10 ] 4 [ 11 ] 5 [ 11 ] 6 [ 11 ] 7 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 8 [ 1 ] 9 [ 2 ] ![]() ©2005 Association for Computing Machinery |