Sciweavers

1940 search results - page 38 / 388
» Optimizing search engines using clickthrough data
Sort
View
SPAA
1990
ACM
14 years 27 days ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
WWW
2006
ACM
14 years 9 months ago
Mining search engine query logs for query recommendation
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
Zhiyong Zhang, Olfa Nasraoui
CN
1998
207views more  CN 1998»
13 years 8 months ago
The Anatomy of a Large-Scale Hypertextual Web Search Engine
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the...
Sergey Brin, Lawrence Page
JIS
2008
119views more  JIS 2008»
13 years 8 months ago
A three-year study on the freshness of web search engine databases
This paper deals with one aspect of the index quality of search engines: index freshness. The purpose is to analyse the update strategies of the major Web search engines Google, Y...
Dirk Lewandowski
WISE
2005
Springer
14 years 2 months ago
Temporal Ranking of Search Engine Results
Existing search engines contain the picture of the Web from the past and their ranking algorithms are based on data crawled some time ago. However, a user requires not only relevan...
Adam Jatowt, Yukiko Kawai, Katsumi Tanaka