Sciweavers

302 search results - page 42 / 61
» Smoothing clickthrough data for web search ranking
Sort
View
113
Voted
EMNLP
2010
14 years 7 months ago
Learning Recurrent Event Queries for Web Search
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 ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
JUCS
2006
225views more  JUCS 2006»
14 years 9 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
CIKM
2008
Springer
14 years 11 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
SIGMOD
2000
ACM
85views Database» more  SIGMOD 2000»
15 years 2 months ago
Finding Replicated Web Collections
Many web documents (such as JAVA FAQs) are being replicated on the Internet. Often entire document collections (such as hyperlinked Linux manuals) are being replicated many times....
Junghoo Cho, Narayanan Shivakumar, Hector Garcia-M...
RIAO
2007
14 years 11 months ago
Homepage Finding in Hybrid Peer-to-Peer Networks
This paper illustrates a ranking scheme which combines fulltext, anchor text and URL structure for homepage finding in hybrid peer-to-peer networks. The experimental results show...
Enrico Bragante, Massimo Melucci