3778 search results - page 304 / 756 » Representing Web Graphs |
187
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
261
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
198
Voted
PDP
2006
IEEE
16 years 20 days ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
162
click to vote
ICPADS
2005
IEEE
16 years 7 days ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
243
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...