1513 search results - page 240 / 303 » Cryptographic Pattern Matching |
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
IEEECIT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—The increasing need for continuously available software systems has raised two key-issues: self-adaptation and design evolution. The former one requires software systems...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...