Sciweavers

733 search results - page 74 / 147
» Recommending random walks
Sort
View
96
Voted
WWW
2006
ACM
15 years 10 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
FOCS
2009
IEEE
15 years 4 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
SIGIR
2009
ACM
15 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
SIGIR
2006
ACM
15 years 3 months ago
Topical link analysis for web search
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
Lan Nie, Brian D. Davison, Xiaoguang Qi
MIDDLEWARE
2005
Springer
15 years 3 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper