1000 search results - page 123 / 200 » Nominal rewriting systems |
119
Voted
CORR
2008
Springer
15 years 5 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...
143
click to vote
CORR
2008
Springer
15 years 5 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...
149
click to vote
PPL
2008
15 years 5 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...
180
click to vote
ESSLLI
2009
Springer
15 years 3 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...
121
click to vote
ISBI
2008
IEEE
15 years 12 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)...