13621 search results - page 280 / 2725 » Computability and Complexity in Self-assembly |
195
click to vote
FOSSACS
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
159
click to vote
ICRA
2005
IEEE
16 years 8 days ago
2005
IEEE
— Moments are generic (and usually intuitive) descriptors that can be computed from several kinds of objects defined either from closed contours or from a set of points. In this...
158
click to vote
DNA
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
170
click to vote
ISVC
2005
Springer
16 years 5 days ago
2005
Springer
The Ambient Intelligence (AmI) paradigm requires a robust interpretation of people actions and behaviour and a way for automatically generating persistent spatial-temporal models o...
197
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...