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 70 for “"Bipartite Matching"”.

  1. Variations of online bipartite matching

    The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …

    uiuc Repository record for Variations of online bipartite matching (opens in a new tab)

  2. Online Bipartite Matching under Markov Chain Model

    Online bipartite matching (OBM) has a rich history in the literature of online algorithms, where it has been an influential problem inspiring many algorithms and techniques. This problem of obtaining a matching set of maximum size where vertices of one bi-partition arrive online has many real-world …

    concordia Download PDF for Online Bipartite Matching under Markov Chain Model (opens in a new tab)

  3. Efficient algorithms for bipartite matching problems with preferences

    Matching problems involve a set of participants, where each participant has a capacity and a subset of the participants rank a subset of the others in order of preference (strictly or with ties). Matching problems are motivated in practice by large-scale applications, such as automated matching …

    glasgow Download PDF for Efficient algorithms for bipartite matching problems with preferences (opens in a new tab)

  4. Two Algorithmic Schemes for Geometric Bipartite Matching and Transportation

    … space and a distance function, the geometric bipartite matching problem is to find a matching of red points to blue points, such that the sum of distances between the matched pairs is minimized. The general graph problem, minimum-cost bipartite matching, can be solved in polynomial time using …

    duke Repository record for Two Algorithmic Schemes for Geometric Bipartite Matching and Transportation (opens in a new tab)

  5. Robust Exact Algorithms for the Euclidean Bipartite Matching Problem

    The minimum cost bipartite matching problem is a well-studied optimization problem in computer science and operations research, with wide-ranging applications in fields such as machine learning, economics, transportation, logistics and biology. A special instance of this problem is the computation …

    vt Repository record for Robust Exact Algorithms for the Euclidean Bipartite Matching Problem (opens in a new tab)

  6. Warm Start Algorithms for Bipartite Matching and Optimal Transport

    Minimum Cost Bipartite Matching and Optimal Transport are essential optimization challenges with applications in logistics, artificial intelligence, and multimodal data alignment. These problems involve finding efficient pairings while minimizing costs. Due to the combinatorial nature of …

    vt Repository record for Warm Start Algorithms for Bipartite Matching and Optimal Transport (opens in a new tab)

  7. Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm

    … In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be …

    vt Repository record for Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm (opens in a new tab)

  8. Spatiotemporal random bipartite matching problems and applications in mobility systems

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-12-01

    uiuc Repository record for Spatiotemporal random bipartite matching problems and applications in mobility systems (opens in a new tab)

  9. Using Bipartite Matching and Detection Transformers for Document Layout Analysis Transfer Learning

    … Object Detection with Transformers". Using bipartite matching, LayoutLMDet removes the need for surrogate tasks, simplifying implementation. Leveraging a pretrained transformer encoder, LayoutLMDet is able to achieve a mean average precision of 49.5 on the DocLayNet test dataset. A …

    carleton Repository record for Using Bipartite Matching and Detection Transformers for Document Layout Analysis Transfer Learning (opens in a new tab)

  10. A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs

    Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel …

    vt Repository record for A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs (opens in a new tab)

  11. Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems

    … This algorithm is motivated by the Robust-Matching Algorithm [RMAlgorithm, Raghvendra, APPROX 2016] for the closely related online bipartite matching problem. We then give a comprehensive experimental analysis of this algorithm and also provide a graphical user interface which can be used …

    vt Repository record for Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems (opens in a new tab)

  12. Bipartite Matching and Routing with Congestion Costs: A convex approach to robot task assignment and the multi-agent pathfinding problem

    … optimization problem to minimize the overall matching and routing cost. Two problem settings considered are the street network of Seattle City and the multi-robot system in a warehouse where the drivers and robots are the agents, and the delivery locations are the tasks. We apply our …

    washington Repository record for Bipartite Matching and Routing with Congestion Costs: A convex approach to robot task assignment and the multi-agent pathfinding problem (opens in a new tab)

  13. Voting-Based Consensus of Data Partitions

    … problem is commonly formulated as a weighted bipartite matching problem. In this dissertation, a general theoretical framework for the voting problem as a multi-response regression problem is proposed. The problem is formulated as seeking to estimate the uncertainties associated with the …

    waterloo Repository record for Voting-Based Consensus of Data Partitions (opens in a new tab)

  14. Overcoming Computational Complexity Barriers for Optimal Transport in Discrete and Semi-Discrete Settings

    … the problem is equivalent to the minimum-cost bipartite matching problem. In this thesis, we study the semi-discrete OT and the minimum-cost bipartite matching problems. The sensitivity of OT to noise has motivated the study of robust variants. Two such formulations are: (i) the $alpha$-optimal …

    vt Repository record for Overcoming Computational Complexity Barriers for Optimal Transport in Discrete and Semi-Discrete Settings (opens in a new tab)

  15. 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 …

    chalmers Repository record for Greedy Matching Algorithms in Semi-Streaming Environments for Large Bipartite Graphs (opens in a new tab)

  16. Understanding the Impact of Training and Inference Components in Semantic Segmentation

    … on loss functions, inference strategies, and matching techniques. Motivated by the observation that transformer based segmentation models often rely on inference strategies that differ from the classic approaches commonly used in CNN based architectures, this thesis first investigates the …

    waterloo Repository record for Understanding the Impact of Training and Inference Components in Semantic Segmentation (opens in a new tab)

  17. Observational Data With A Continuous Exposure: Study Design And Outcome Analysis

    Subclassification and matching are often used in empirical studies to adjust for observed covariates; however, they are largely restricted to relatively simple study designs with a binary exposure and less developed for designs with a continuous exposure. This thesis contains three papers …

    penn Repository record for Observational Data With A Continuous Exposure: Study Design And Outcome Analysis (opens in a new tab)

  18. Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks

    … with modifications that exploit perfect matching to a greater extent. Hamilton cycles are expressed as specially constructed block permutation matrices. The algorithm attempts to decide a graph's non-Hamiltonicity by checking for the non-existence of these permutation matrices using the …

    guelph Repository record for Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks (opens in a new tab)

  19. Algorithmic Fairness and Online Decision Making in Combinatorial Optimization and Unsupervised Learning

    … and unsupervised learning problems such as graph matching, set packing, and clustering are commonly used to model large-scale real-world applications. Examples of such applications include facility location problems to provide services in emergency, online advertising markets (matching ads to …

    maryland Repository record for Algorithmic Fairness and Online Decision Making in Combinatorial Optimization and Unsupervised Learning (opens in a new tab)

Page 1 of 4