125 search results - page 7 / 25 » Inferring Query Performance Using Pre-retrieval Predictors. |
119
click to vote
SIGIR
2005
ACM
15 years 8 months ago
2005
ACM
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...
274
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
102
click to vote
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
133
click to vote
KR
1992
Springer
15 years 6 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
102
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...