304 search results - page 33 / 61 » Mining query subtopics from search log data |
164
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
163
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
167
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
157
click to vote
DSS
2007
15 years 6 months ago
2007
In this paper, we report results of an investigation into the factors influencing the selection of sponsored links by e-commerce Web searchers. In this research, 56 participants e...
203
click to vote
EMNLP
2010
15 years 4 months ago
2010
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...