1088 search results - page 161 / 218 » Probabilistic query expansion using query logs |
122
click to vote
PODS
2004
ACM
16 years 3 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
112
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
136
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
116
click to vote
OOPSLA
2007
Springer
15 years 9 months ago
2007
Springer
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
120
click to vote
CLEF
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2006. This year we are not using the tools for thesaurus-based query expansion a...