1889 search results - page 151 / 378 » Re-ranking search results using query logs |
160
Voted
BMCBI
2011
14 years 4 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
133
Voted
ADAPTIVE
2007
Springer
15 years 2 months ago
2007
Springer
With the exponential growth of the available information on the World Wide Web, a traditional search engine, even if based on sophisticated document indexing algorithms, has diffi...
93
Voted
HICSS
2006
IEEE
15 years 6 months ago
2006
IEEE
Search services are now ubiquitously employed in searching for documents on the Internet and on enterprise intranets. This research develops an economic model for comparing search...
80
Voted
SIGIR
2003
ACM
15 years 6 months ago
2003
ACM
Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactiv...
105
click to vote
CORR
2010
Springer
15 years 24 days ago
2010
Springer
This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter ...