Sciweavers

Share
4 search results - page 1 / 1
» Approximating the top-m passages in a parallel question answ...
Sort
View
CIKM
2004
Springer
11 years 5 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
TREC
2003
11 years 1 months ago
QED: The Edinburgh TREC-2003 Question Answering System
This report describes a new open-domain answer retrieval system developed at the University of Edinburgh and gives results for the TREC-12 question answering track. Phrasal answer...
Jochen L. Leidner, Johan Bos, Tiphaine Dalmas, Jam...
CLEF
2010
Springer
11 years 5 days ago
Overview of ResPubliQA 2010: Question Answering Evaluation over European Legislation
This paper describes the second round of ResPubliQA, a Question Answering (QA) evaluation task over European legislation, a LAB of CLEF 2010. Two tasks have been proposed this year...
Anselmo Peñas, Pamela Forner, Álvaro...
HIPC
2007
Springer
11 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
books