1000 search results - page 121 / 200 » Dependency Tree Automata |
91
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
106
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
COLING
2008
15 years 2 months ago
2008
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
89
Voted
ACL
2006
15 years 2 months ago
2006
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...