Sciweavers

1088 search results - page 161 / 218
» Probabilistic query expansion using query logs
Sort
View
PODS
2004
ACM
128views Database» more  PODS 2004»
14 years 9 months ago
Replicated Declustering of Spatial Data
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...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
SIGIR
2010
ACM
14 years 23 days ago
Studying trailfinding algorithms for enhanced web search
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...
Adish Singla, Ryen White, Jeff Huang
FCT
2009
Springer
14 years 3 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
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...
Peter Damaschke, Azam Sheikh Muhammad
OOPSLA
2007
Springer
14 years 3 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
CLEF
2006
Springer
14 years 17 days ago
Domain Specific Retrieval: Back to Basics
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...
Ray R. Larson