Sciweavers

915 search results - page 49 / 183
» Ranking the web frontier
Sort
View
EPEW
2005
Springer
15 years 6 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
129
Voted
WEBI
2010
Springer
14 years 10 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet
104
Voted
SIGIR
2010
ACM
15 years 4 months ago
Freshness matters: in flowers, food, and web authority
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
Na Dai, Brian D. Davison
123
Voted
WWW
2003
ACM
16 years 1 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
128
Voted
ICITA
2005
IEEE
15 years 6 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak