Click a term to refine your current search.
... M0 to be an inverse of a schema mapping M for a class S of source instances. We call such an inverse an S-inverse. A particular case of interest arises when S is the class of all ...
Publication - cat - 04/16/2013 - 18:27 - 0 comments - 1 attachment
... algorithm has the same asymptotic complexity as Selkow's algorithm. (Selkow's distance measure requires that all node deletions and insertions occur at ...
Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments