1000 search results - page 123 / 200 » Nominal rewriting systems |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...
PPL
2008
13 years 8 months ago
2008
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
ESSLLI
2009
Springer
13 years 6 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
ISBI
2008
IEEE
14 years 3 months ago
2008
IEEE
The use of X-ray CT images for CT-based attenuation correction (CTAC) of PET data results in the decrease of overall scanning time and creates a noise-free attenuation map (μmap)...