Sciweavers

729 search results - page 55 / 146
» Communicating Evolving Algebras
Sort
View
EKAW
2006
Springer
14 years 11 days ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
DKE
2006
79views more  DKE 2006»
13 years 8 months ago
Schema versioning in data warehouses: Enabling cross-version querying via schema augmentation
As several mature implementations of data warehousing systems are fully operational, a crucial role in preserving their up-to-dateness is played by the ability to manage the chang...
Matteo Golfarelli, Jens Lechtenbörger, Stefan...
JDA
2006
184views more  JDA 2006»
13 years 8 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
IFIP
2009
Springer
14 years 3 months ago
Analysing the Information Flow Properties of Object-Capability Patterns
We consider the problem of detecting covert channels within security-enforcing object-capability patterns. Traditional formalisms for reasoning about the security properties of obj...
Toby C. Murray, Gavin Lowe
DIS
2007
Springer
14 years 2 months ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Simon Colton