Sciweavers

477 search results - page 86 / 96
» Storing RDF as a Graph
Sort
View
CASES
2009
ACM
13 years 7 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
EXACT
2009
13 years 7 months ago
Towards the Explanation of Workflows
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...
James Michaelis, Li Ding, Deborah L. McGuinness
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III
FGCS
2011
123views more  FGCS 2011»
13 years 4 months ago
Mapping attribution metadata to the Open Provenance Model
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...
Simon Miles
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 4 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham