13603 search results - page 410 / 2721 » On the Computational Complexity of Cut-Reduction |
174
click to vote
ICRA
2005
IEEE
16 years 1 months 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...
178
click to vote
DNA
2005
Springer
16 years 1 months 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...
193
Voted
ISVC
2005
Springer
16 years 1 months 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...
224
click to vote
MFCS
2005
Springer
16 years 1 months 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...
188
click to vote
FCT
2003
Springer
16 years 28 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...