2253 search results - page 24 / 451 » Computing with Realizational Morphology |
TCS
2011
14 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
CCCG
2009
14 years 7 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
DGCI
2003
Springer
15 years 2 months ago
2003
Springer
We use a mathematical morphology approach to compute the surface and curve skeletons of a 3D object. We focus on the behaviour of the surface skeleton, in particular the reversibil...
71
Voted
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...