662 search results - page 43 / 133 » Trees, Automata and XML |
135
click to vote
DOCENG
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
166
click to vote
WEBDB
2005
Springer
15 years 11 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
156
click to vote
QEST
2008
IEEE
16 years 14 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
178
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
182
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...