977 search results - page 122 / 196 » Permuting Web Graphs |
139
click to vote
PDP
2006
IEEE
15 years 9 months 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...
120
click to vote
ICPADS
2005
IEEE
15 years 8 months 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...
176
click to vote
EDBT
2011
ACM
14 years 6 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...
136
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
124
click to vote
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...