662 search results - page 79 / 133 » Trees, Automata and XML |
170
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
117
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft? SQL ServerTM. ORDPATH labels nodes of an XML tree without requ...
177
click to vote
JCSS
2008
15 years 6 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
178
click to vote
MSV
2004
15 years 7 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
150
click to vote
JALC
2007
15 years 6 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...