Sciweavers

3652 search results - page 339 / 731
» A study of query length
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 7 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 7 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
CLEF
2008
Springer
15 years 5 months ago
UJM at ImageCLEFwiki 2008
This paper reports our multimedia information retrieval experiments carried out for the ImageCLEF track (ImageCLEFwiki). The task is to answer to user information needs, i.e. quer...
Christophe Moulin, Cécile Barat, Mathias G&...
TREC
2003
15 years 5 months ago
Fondazione Ugo Bordoni at TREC 2003: Robust and Web Track
Our participation in TREC 2003 aims to adapt the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) to the robust track and the topic distillation task o...
Giambattista Amati, Claudio Carpineto, Giovanni Ro...
TREC
2003
15 years 5 months ago
Overview of the TREC 2003 Web Track
The TREC 2003 web track consisted of both a non-interactive stream and an interactive stream. Both streams worked with the .GOV test collection. The non-interactive stream continu...
Nick Craswell, David Hawking, Ross Wilkinson, Ming...