Haut PDF Approximate Graph Matching for Software Engineering
Approximate Graph Matching for Software Engineering
... inexact graph matching). Exact graph matching includes well-known problems of graph theory such as graph isomorphism but it imposes a strict correspondence on nodes and relations ...
196
A path following algorithm for the graph matching problem
... includes approximate algorithms which are supposed to be much more ...pay for the scalability is that the solution found is usually only an approximation of the optimal ...matching. ...
28
End-user software engineering for the personal web: poster
... reused for building new PW ...COs. For instance, a CO matching a film entity may be enhanced with the behaviour of showing a related trailer on ...available for every PW ...means for ...
4
Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)
... Information Engineering Politecnico di Bari, Via Orabona 4 - 70125, Bari, Italy Abstract—Methodologies for correct by construction reconfigu- rations can efficiently solve consistency issues in dynamic ...
2
A Google-inspired error-correcting graph matching algorithm
... a graph, but this is still an interesting starting point for a graph matching prob- lem and, among some others, Umeyama [24] pioneered the above ...as approximate matching is ...
21
A Context-Based Measure for Discovering Approximate Semantic Matching between Schema Elements
... hybrid matching tool that can incorporate many independent matching ...strategies, for example the reuse-oriented matching or the fragment-based matching, can be included, offering dif- ...
12
Fast Exact Hyper-Graph Matching with Dynamic Programming for Spatio-Temporal Data
... Nevertheless, for completeness we give our performance results along with those of some of the state-of-the-art methods as reported in the respective original ...s). For example, the method proposed by Ta ...
20
Attributed Graph Matching using Local Descriptions
... representations for documents, and many recognition problems can be formulated as an attributed graph matching problem, where nodes of the graphs correspond to local features of the document and ...
13
Algorithmic and software contributions to graph mining
... to graph mining is well known in the ...pattern matching [ Thanou et ...], graph embedding [ Donnat et al. , 2018 ], graph clustering [ Tremblay and Borgnat , 2014 ], and semi-supervised ...
110
Enhanced Graph Rewriting Systems for Complex Software Domain
... the graph, ...modifications, graph transformation environ- ments relying on this model usually allows the specification of changes within or alongside a ...tablished graph transformation ...handles ...
22
End-user software engineering for the personal web: poster
... reused for building new PW ...COs. For instance, a CO matching a film entity may be enhanced with the behaviour of showing a related trailer on ...available for every PW ...means for ...
5
Evaluation of Graph Matching Measures for Documents Retrieval
... Keywords: Graph matching, Graph retrieval, Structural representation, Performance ...with graph-based ...the graph matching problem which is a problem of computing distances ...
10
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 2
... simulation software by either reusing existing general purpose soft- ware products and concepts or by writting the simulation software from ...basis for building a new ...selected software, ...
13
Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm
... 3 CMLA, ENS Cachan, France (pauline.tan@ens-cachan.fr) Abstract Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar ...
33
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 1
... The different approach discussed in this arti- cle consists in building a new product by reusing already existing products and implemented tech- niques. This is actually no less than implement- ing a form of reuse, which ...
13
Complexity issues in Vertex-Colored Graph Pattern Matching
... the Graph Motif problem, this problem is clearly NP-hard as ...target graph is a path and is not approximable within ratio c log n for some constant c > 0 if the target graph is a tree, ...
34
Enhancing Ontology Matching by Using Machine Learning, Graph Matching and Information Retrieval Techniques
... methods can be found in every tools (e.g. COMA [4], AgreementMaker [26], ASMOV [42], etc.) and their mapping results are normally used as input to other methods. Structural methods. These methods exploit the structural ...
199
Graph matching over Hypothesis Graphs for the Analysis of Handwritten Arithmetic Operations
... work for the analysis of handwritten arithmetic operations in the context of ...a graph containing both expected numbers and their corresponding relationship one to ...Visibility Graph of symbols ...
3
GVSR: an On-Line Guide for Choosing a Graph Visualization Software
... a software : 1) a tag cloud with the software names (the more a software page is accessed, the bigger its name is displayed); 2) the “Software List” link gives access to a simple alphabetical ...
3
How Graph Theory can help Communications Engineering
... But besides the general results and models for inter
onne
tion networks that an be also useful in our ontext, new spe
i problems appeared in the study of all opti
al networks. These problems are not ex
lusive of ...
14