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 10 of 10 for “"scaling algorithm"”.

  1. Min Cost Flow in balancierten Netzwerken mit konvexer Kostenfunktion

    … Stone. Using these results we present several algorithms to solve the Convex BMCF problem. We present the first complete version of the Primal-Dual algorithm previously studied by Fremuth-Paeger and Jungnickel. However, we only consider the case of positive costs. We also show how to apply this …

    heid-thes Repository record for Min Cost Flow in balancierten Netzwerken mit konvexer Kostenfunktion (opens in a new tab)

  2. Network Optimization-based Approach for Identification of Illegal Trade in the Global Timber Supply Chain

    … classic optimization formulations and matrix scaling-based algorithms. We extend the well-known formulation of matrix scaling algorithms to include prior knowledge of the reliability of the data. We propose a link-specific weighted iterative scaling algorithm (WIS) and a node-specific weighted …

    mit Repository record for Network Optimization-based Approach for Identification of Illegal Trade in the Global Timber Supply Chain (opens in a new tab)

  3. A NEW SUBAPERTURE APPROACH TO HIGH SQUINT SYNTHETIC APERTURE RADAR PROCESSING

    … In this project, a High Squint Subaperture (HSS) algorithm was developed. The HSS was developed from the perspective of a stripmap Synthetic Aperture Radar (SAR) system and has the ability to focus SAR data at extremely high squint angle of 55 degrees with less than 1.27 % mainlobe expansion or …

    nus Repository record for A NEW SUBAPERTURE APPROACH TO HIGH SQUINT SYNTHETIC APERTURE RADAR PROCESSING (opens in a new tab)

  4. Dynamic estimation of origin-destination trip-tables from real-time traffic volumes using parameter optimization methods

    … squares problem, and an interior point affine scaling algorithm that is applied to the dual problem is explored for solving the <i>1</i>₁ estimation linear programming problem. Computational results are presented on a set of test problems involving the determination of O-D trip tables for both …

    vt Repository record for Dynamic estimation of origin-destination trip-tables from real-time traffic volumes using parameter optimization methods (opens in a new tab)

  5. Convex relaxation methods for graphical models : Lagrangian and maximum entropy approaches

    … subgraphs. We develop a distributed, iterative algorithm that minimizes the Lagrangian dual function by block coordinate descent. This results in an iterative marginal-matching procedure that enforces consistency among the subgraphs using an adaptation of the well-known iterative scaling

    mit Repository record for Convex relaxation methods for graphical models : Lagrangian and maximum entropy approaches (opens in a new tab)

  6. Synthetic aperture sonar imaging using compressive sensing and an ultrasound transducer array

    … was focused using the accelerated chirp scaling algorithm. Compressive sensing was applied to a stack of focused 2D SAS images to achieve focusing in the elevation direction. 3D scenes containing point targets were successfully reconstructed in 3D SAS images using this technique with 9 …

    cape-town Repository record for Synthetic aperture sonar imaging using compressive sensing and an ultrasound transducer array (opens in a new tab)

  7. Investigating the Process-Structure-Property Relationships in Vat Photopolymerization to Enable Fabrication of Performance Polymers

    … and used to develop an iterative gray-scaling algorithm that generated a combination of gray-scaled bitmap images and exposure times that result in accurate volumetric curing (errors in XY plane and Z axis < 5% and 3% respectively). Results of this work demonstrate that the elimination …

    vt Repository record for Investigating the Process-Structure-Property Relationships in Vat Photopolymerization to Enable Fabrication of Performance Polymers (opens in a new tab)

  8. Algorithms for flows and disjoint paths in planar graphs

    In this dissertation we describe several algorithms for computing flows, connectivity, and disjoint paths in planar graphs. In all cases, the algorithms are either the first polynomial-time algorithms or are faster than all previously-known algorithms. First, we describe algorithms for the maximum …

    uiuc Repository record for Algorithms for flows and disjoint paths in planar graphs (opens in a new tab)

  9. The mental model comparison of expert and novice performance improvement practitioners

    … model of expertise derived from Pathfinder scaling algorithm. The study was stemmed from one of the critical research trends in the field of Human Performance Technology (HPT). </p> <p>There are two phases of the study. In the first round of the first phase, experts, who were selected based …

    wayne-thes Repository record for The mental model comparison of expert and novice performance improvement practitioners (opens in a new tab)

  10. Optimal transport: theory, algorithms and applications

    … constantly appearing new variants, insights, algorithms and applications. This is a cumulative thesis, which contains the publications [96, 153, 24, 152, 151] and the unpublished work [154] in the Appendix A. We start with an overview of our corresponding findings and results. First, in …

    tu-berlin Repository record for Optimal transport: theory, algorithms and applications (opens in a new tab)