662 search results - page 50 / 133 » Trees, Automata and XML |
166
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
163
click to vote
DLT
2003
15 years 7 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
172
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
127
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper considers a tree-rewriting framework for modeling documents evolving through service calls. We focus on the automatic verification of properties of documents that may c...
162
click to vote
SOFSEM
2004
Springer
15 years 11 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...