662 search results - page 74 / 133 » Trees, Automata and XML |
163
click to vote
APLAS
2006
ACM
16 years 1 days ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
155
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
147
click to vote
SAMT
2007
Springer
16 years 5 days ago
2007
Springer
Abstract—This paper presents an annotation tool for the manual and region-based annotation of still images. The selection of regions is achieved by navigating through a Partition...
181
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
166
click to vote
ICML
2002
IEEE
16 years 6 months ago
2002
IEEE
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...