Sciweavers

188 search results - page 11 / 38
» The Link Database: Fast Access to Graphs of the Web
Sort
View
IM
2007
13 years 8 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
WWW
2003
ACM
14 years 9 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...
SPIRE
2009
Springer
14 years 3 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
SEMWEB
2009
Springer
14 years 3 months ago
A Database Backend for OWL
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...
Jörg Henss, Joachim Kleb, Stephan Grimm
EDBT
2012
ACM
315views Database» more  EDBT 2012»
11 years 11 months ago
Sieve: linked data quality assessment and fusion
The Web of Linked Data grows rapidly and already contains data originating from hundreds of data sources. The quality of data from those sources is very diverse, as values may be ...
Pablo N. Mendes, Hannes Mühleisen, Christian ...