903 search results - page 35 / 181 » Non-well-founded trees in categories |
DOCENG
2006
ACM
15 years 5 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
DMKD
2003
ACM
15 years 5 months ago
2003
ACM
HTML anchors are often surrounded by text that seems to describe the destination page appropriately. The text surrounding a link or the link-context is used for a variety of tasks...
107
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
PODS
2007
ACM
15 years 12 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
PODS
2007
ACM
15 years 12 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...