5578 search results - page 948 / 1116 » Base Class Injection |
202
click to vote
MST
2006
15 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
144
click to vote
PAMI
2008
15 years 6 months ago
2008
Morphological attribute filters have not previously been parallelized mainly because they are both global and nonseparable. We propose a parallel algorithm that achieves efficient ...
158
click to vote
IANDC
2007
15 years 6 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
194
click to vote
IANDC
2007
15 years 6 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
171
click to vote
IDA
2007
Springer
15 years 6 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...