Sciweavers

19 search results - page 2 / 4
» Named graphs, provenance and trust
Sort
View
SEMWEB
2009
Springer
13 years 11 months ago
Coloring RDF Triples to Capture Provenance
Abstract. Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and know...
Giorgos Flouris, Irini Fundulaki, Panagiotis Pedia...
WWW
2004
ACM
14 years 5 months ago
Using context- and content-based trust policies on the semantic web
The current discussion about a future Semantic Web trust architecture is focused on reputational trust mechanisms based on explicit trust ratings. What is often overlooked is the ...
Christian Bizer, Radoslaw Oldakowski
WWW
2005
ACM
14 years 5 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...
HPDC
2010
IEEE
13 years 5 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
BIRTHDAY
2008
Springer
13 years 6 months ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky