Sciweavers

16626 search results - page 341 / 3326
» Computing is a natural science
Sort
View
153
Voted
RTA
2005
Springer
16 years 9 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
TLCA
2005
Springer
16 years 9 days ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
WG
2005
Springer
16 years 9 days ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
166
Voted
GG
2004
Springer
16 years 6 days ago
A Perspective on Graphs and Access Control Models
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
Ravi S. Sandhu
GI
2004
Springer
16 years 6 days ago
Dynamic information fusion for genome annotation
: The need for demand-driven and scaleable integration of heterogeneous data sources is inherent to the process of genome annotation. In this paper we describe the Gene-EYe archite...
Heiko Müller, Peter Rieger, Katja Tham, Johan...