Sciweavers

1109 search results - page 105 / 222
» Crawling on web graphs
Sort
View
158
Voted
CIKM
2010
Springer
15 years 3 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 11 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
WWW
2009
ACM
16 years 5 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
ENTCS
2006
117views more  ENTCS 2006»
15 years 4 months ago
Interpreting SWRL Rules in RDF Graphs
An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics....
Jing Mei, Harold Boley
WIDM
2005
ACM
15 years 10 months ago
Web path recommendations based on page ranking and Markov models
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
Magdalini Eirinaki, Michalis Vazirgiannis, Dimitri...