140 search results - page 6 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
IDEAS
2006
IEEE
14 years 2 months ago
2006
IEEE
Updating XML documents submitted to schema constraints requires incremental validation, i.e. checking the parts of the document concerned by the updates. We propose to correct sub...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
WG
1999
Springer
14 years 25 days ago
1999
Springer
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
SEMWEB
2007
Springer
14 years 2 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...