Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 38 for “"Graph matching"”.
-
Parallel algorithms for labeled graph matching
Includes bibliographical references (pages 114-122).
-
Graph matching by graph neural network
Graph matching or network alignment refers to the problem of matching two correlated graphs. This thesis presents a deep Q learning based method, which represents the matching process by a graph neural network. By breaking the symmetry, the parameterized graph neural network is able to capture a …
-
A Separator-Based Framework for Graph Matching Problems
Given a graph, a matching is a set of vertex-disjoint edges. Graph matchings have been well studied, since they play a fundamental role in algorithmic theory as well as motivate many practical applications. Of particular interest is the problem of finding a maximum cardinality matching of a graph. …
-
Understanding the importance of side information in graph matching problem
Graph matching algorithms rely on the availability of seed vertex pairs as side information to deanonymize users across networks. Although such algorithms work well in practice, there are other types of side information available which are potentially useful to an attacker. In this thesis, we …
-
Improving the output of algorithms for large-scale approximate graph matching
In approximate graph matching, the goal is to find the best correspondence between the labels of two correlated graphs. Recently, the problem has been applied to social network de-anonymization, and several efficient algorithms have been proposed for approximate graph matching in that domain. These …
-
StructureTransfer: A Scene Parsing Framework via Graph Matching for Images and Point Clouds
Scene parsing is to densely label the pixels in an image with the semantic categories. In this thesis, we present a scene parsing framework which can work on both images and point clouds. To this end, we develop two separate pipelines for images and point clouds. For point clouds, a coarse …
-
A complete reified temporal logic and its applications
… CRTL system (SCRTL) is defined as scenarios and graphically represented in terms of a directed, partially weighted or attributed, simple graph. Therefore, the problem of matching temporal scenarios is transformed into conventional graph matching. For the scenario graph matching problem, the …
-
On Ranked Approximate Matching Of Large Attributed Graphs
… database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale</p> <p>scientific applications. To access the information embedded in</p> <p>graphs, efficient graph matching tools and algorithms have become of prime importance. Although the …
-
A structural framework for assembly modeling and recognition
… structural approach that combines syntactic and graph-based methods for pattern recognition: simple context free grammars are well suited to model entire classes of mechanical assemblies. Implemented as semantic networks and applying parsing strategies known from discourse theory, they enable the …
-
Face Recognition: Study and Comparison of PCA and EBGM Algorithms
… problem. Genetic algorithm, elastic bunch graph matching, artificial neural network, etc. are few of the techniques that have been proposed and implemented. The objective of this thesis paper is to provide insight into different methods available for face recognition, and explore methods …
-
Applying case based reasoning and structural similarity for effective retrieval of expert knowledge from software designs
… which combines case-based reasoning with graph matching to retrieve knowledge from class diagrams using only structural information. The practical applicability of this research has been demonstrated in the areas of cost estimation and plagiarism detection. It was shown that by applying …
-
Efficient and proven verification of unreliable hardware executions of classic algorithms
… linear programming, sorting, 3SUM, graph matching and others. Writing a correct checker is hard, since often intricate corner cases get overlooked. Our system, SOUNDCHECK, helps reduce burden on programmers by automatically proving soundness and completeness of checkers with bounded …
-
Correspondence among connectomes as combinatorial optimization
… as a set of 3D polylines, by means of tractography algorithms. The neuronal axons within the white matter form the anatomical links between regions of the brain, which are referred to as anatomical connectivity, or structural connectivity. The complete collection of structural connectivity is …
-
Nonlinear machine learning of macromolecular folding and self-assembly
… pressure and solvent conditions. I then employ graph matching and non-linear manifold learning to obtain asphaltene folding and assembly free energy landscapes. This thesis establishes new fundamental understanding of the folding and assembly of macromolecules, builds connections between …
-
Graph similarity and matching
Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. This thesis surveys several different notions of similarity, then focuses …
-
An adaptive framework for high-order, mixed-element numerical simulations
… then combined to form quadrilaterals through a graph-matching approach. The resulting straight-sided mesh is then curved using a nonlinear elasticity analogy. Since the element sizes and orientations are prescribed to the mesh generator through a field of Riemannian metric tensors, the …
-
Base selection in analogical planning
… can be derived. A scNAGRAM expresses plans as graphs and uses a graph matching algorithm to identify potential analogies and form the mapping between a base problem and the target problem. A scNAGRAM takes advantage of the massively parallel architecture of the Connection Machine to perform …
-
A Feature-Based Call Graph Distance Measure for Program Similarity Analysis
… programs is a complex task. By extracting call graphs (graphs of caller-callee relationships of the program's functions, where nodes denote functions and directed edges denote function calls) from the programs, the similarity measurement can be changed into a graph problem. Previously, static …
-
Deformable meshes for shape recovery: models and applications
… versatile tool, mesh is widely used in computer graphics for modelling and visualization. In particular, deformable meshes are meshes which can take the deformation of deformable objects. They extend the modelling ability of meshes. This dissertation focuses on using deformable meshes to approach …
-
An investigation of the feasibility of a CBR approach to the design of sand castings in the foundry industry
… on feature-value pairs, and metrics based on graph matching. A set of performance measures appropriate to the casting problem was formulated and a prototype retrieval system was produced and implemented as a CBR system. A test case base representing a sub-domain of rotationally symmetric …
Page 1 of 2