1154 search results - page 39 / 231 » On the editing distance of graphs |
PASTE
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents Lancet, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the linktime rewri...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
In this paper we give models and algorithms to describe and analyze the collaboration among authors of Wikipedia from a network analytical perspective. The edit network encodes wh...
MLCW
2005
Springer
14 years 2 months ago
2005
Springer
The Recognizing Textual Entailment System shown here is based on the use of a broad-coverage parser to extract dependency relationships; in addition, WordNet relations are used to ...
DASFAA
2009
IEEE
14 years 3 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
WG
2010
Springer
13 years 7 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...