115 search results - page 7 / 23 » Versioning Tree Structures by Path-Merging |
DDEP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
SPIRE
2007
Springer
14 years 3 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
DOCENG
2006
ACM
14 years 3 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...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...