1461 search results - page 14 / 293 » The Cost of Cache-Oblivious Searching |
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
AAAI
1996
14 years 10 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
DL
1997
Springer
15 years 1 months ago
1997
Springer
Non-uniform query languages make searching over heterogeneous information sources difficult. Our approach is to allow a user to compose Boolean queries in one rich front-end lang...
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
Topic Detection and Tracking (TDT) tasks are evaluated using a cost function. The standard TDT cost function assumes a constant probability of relevance P(rel) across all topics. ...
AIPS
2007
14 years 11 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...