2061 search results - page 144 / 413 » Modeling search engine effectiveness for federated search |
166
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
176
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
157
click to vote
AVI
2006
15 years 7 months ago
2006
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
175
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
We explore the use of the landing page content in sponsored search ad selection. Specifically, we compare the use of the ad’s intrinsic content to augmenting the ad with the wh...
222
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
This paper uncovers a new phenomenon in web search that we call domain bias — a user’s propensity to believe that a page is more relevant just because it comes from a particul...