Sciweavers

1091 search results - page 59 / 219
» Improving People Search Using Query Expansions
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 3 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
CIKM
2010
Springer
15 years 24 days ago
Modeling reformulation using passage analysis
Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previou...
Xiaobing Xue, W. Bruce Croft, David A. Smith
TREC
2003
15 years 4 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...
115
Voted
ICC
2007
IEEE
115views Communications» more  ICC 2007»
15 years 9 months ago
Cooperation and Routing in Multi-Hop Networks
— We study the cross-layer problem of combining routing and cooperative diversity in multi-hop, bandwidthconstrained networks with dedicated multiple access. Previous work in coo...
Elzbieta Beres, Raviraj Adve
137
Voted
CHI
2011
ACM
14 years 7 months ago
Characterizing the usability of interactive applications through query log analysis
People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and other...
Adam Fourney, Richard Mann, Michael Terry