Sciweavers

747 search results - page 69 / 150
» Theory and Construction of Molecular Computers
Sort
View
CCA
2000
Springer
14 years 11 days ago
Effectivity of Regular Spaces
Abstract. General methods of investigating effectivity on regular Hausdorff (T3) spaces is considered. It is shown that there exists a functor from a category of T3 spaces into a c...
Jens Blanck
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
General Reversibility
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
Vincent Danos, Jean Krivine, Pawel Sobocinski
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 9 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CONCUR
2007
Springer
14 years 2 months ago
Reactive Systems over Directed Bigraphs
We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs...
Davide Grohmann, Marino Miculan
MIRAGE
2007
Springer
14 years 2 months ago
Segmentation of Soft Shadows Based on a Daylight- and Penumbra Model
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
Michael Nielsen, Claus B. Madsen