Sciweavers

5607 search results - page 324 / 1122
» Graph structure in the Web
Sort
View
181
Voted
WWW
2005
ACM
16 years 8 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
JCDL
2006
ACM
152views Education» more  JCDL 2006»
16 years 1 months ago
Also by the same author: AKTiveAuthor, a citation graph approach to name disambiguation
The desire for definitive data and the semantic web drive for inference over heterogeneous data sources requires co-reference resolution to be performed on those data. In particul...
Duncan M. McRae-Spencer, Nigel R. Shadbolt
WEBI
2005
Springer
16 years 27 days ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
222
Voted
WAIM
2010
Springer
15 years 5 months ago
A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
Ricardo A. Baeza-Yates, Nieves R. Brisaboa, Josep-...
COMPGEOM
2010
ACM
16 years 15 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...