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 227 for “"Matching Algorithms"”.
-
Advanced Stereo Matching Algorithms
… highly depends on the robustness and accuracy of algorithms being used, especially the matching algorithms. Unfortunately, current matching algorithms are vulnerable to the lack of texture and the illumination variation, which gives rise to the mismatching problem in matching results. The success …
-
Sensitivity analysis of online string-matching algorithms /
String-matching is a well known and studied problem in computer science that allows us to find occurrences of a pattern inside a text. As datasets grow larger every year, it becomes more and more important to know which algorithms work better in specific situations, as there is not a single …
-
Interoperability of fingerprint sensors and matching algorithms
… There are a multitude of sensors and matching algorithms available from different vendors. This creates a competitive market for these products, which is good for the consumers but emphasizes the importance of interoperability. In fingerprint recognition, interoperability is the …
-
A Comparison Framework for Product Matching Algorithms
Product matching is a specific application of record linkage where different digital records that refer to the same product are identified. In this thesis, we design a framework to compare state-of-the-art product matching systems including traditional machine learning models and more recent deep …
-
Two-sided matching algorithms for dynamic labor markets
… evolving and dynamic economy. While two-sided matching algorithms have been applied to some labor markets during the past decades, they usually assume a static environment in which the strategic interactions between candidates and employers are designed without considering dynamic changes in …
-
Matching algorithms for interest management in distributed virtual environments
… usually involves a process called “interest matching", which determines what data should be sent to the participants as well as what data should be filtered. This thesis surveys the state of the art in interest management systems and defines three major design requirements. Based on the …
-
Strategic Behavior and Manipulation in Gender-Neutral Matching Algorithms
… interactions and strategic behavior. Two-sided matching is one of the most fundamental problems in this field with applications in matching residents to hospitals, kidney donors to receivers and students to high schools. The earliest algorithm that solved this problem is the Gale-Shapley …
-
On the study of tree pattern matching algorithms and applications
… database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementation, and application of two new algorithms to detect cloned …
-
Greedy Matching Algorithms in Semi-Streaming Environments for Large Bipartite Graphs
The maximum weight bipartite matching and the related assignment problem become computationally challenging for large-scale graphs due to the high memory and time demands of optimal algorithms. This thesis investigates the viability of greedy matching algorithms within a semi-streaming environment …
-
A Comparative Study of Three Image Matching Algorithms: Sift, Surf, and Fast
… for assessing the performance of popular image matching algorithms is presented. Specifically, the method assesses the type of images under which each of the algorithms reviewed herein perform to its maximum or highest efficiency. The efficiency is measured in terms of the number of matches …
-
Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms
Η αναζήτηση προτύπων αποτελεί ένα θεμελιώδες πρόβλημα στον κλάδο της Επιστήμης της Πληροφορικής. Σε αυτήν την διατριβή εξετάζεται το πρόβλημα της αναζήτησης πολλαπλών και διδιάστατων προτύπων. Η αναζήτηση πολλαπλών προτύπων μπορεί να οριστεί γενικά ως η εύρεση όλων των θέσεων σε ένα μονοδιάστατο …
-
Improving the Unification of Software Clones using Tree and Graph Matching Algorithms
Code duplication is common in all kind of software systems and is one of the most troublesome hurdles in software maintenance and evolution activities. Even though these code clones are created for the reuse of some functionality, they usually go through several modifications after their initial …
Page 1 of 12