Sciweavers

290 search results - page 5 / 58
» Local Partitioning for Directed Graphs Using PageRank
Sort
View
ICDCS
2005
IEEE
15 years 3 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
EMMCVPR
2001
Springer
15 years 2 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
80
Voted
CN
2007
108views more  CN 2007»
14 years 9 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
WWW
2004
ACM
15 years 10 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 3 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
John E. Hopcroft, Daniel Sheldon