Search: 0, a, Diff, Theory

4 results

Results

Change detection in hierarchically structured information

... Sudarshan, C. S.; Rajaraman, A.; Garcia-Molina, H.; Widom, J. ... Rajaraman, A Garcia-Molina, H ...

Publication - huliganka - 04/17/2013 - 00:49 - 0 comments - 1 attachment

Meaningful change detection in structured data

... These operations allows us to describe changes in a semantically more meaningful way. Since this change detection problem is NP-hard, in this paper we present a heuristic change detection algorithm that yields close to “minimal” ... is based on transforming the change detection problem to a problem of computing a minimum-cost edge cover of a bipartite graph. We study ...

Publication - huliganka - 04/17/2013 - 00:38 - 0 comments - 1 attachment

An O(ND) Difference Algorithm and Its Variations

... 81.22 KB The problems of finding a longest common subsequence of two sequences A and B and a shortest edit script for transforming A into B have long been ...

Publication - huliganka - 04/16/2013 - 23:16 - 0 comments - 1 attachment

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... degree-2 distance, when applied to unordered trees, is a restricted form of the constrained distance previously reported in [27]. When applied to ordered trees, the degree-2 distance is a generalized measure of the constrained distance originated from Selkow ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments