Sökning: "Parallel Algorithm"

Visar resultat 1 - 5 av 251 uppsatser innehållade orden Parallel Algorithm.

  1. 1. Evaluating Performance of Pattern Searching Algorithms on Wildcard Patterns

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Gustav Lindblad; [2023]
    Nyckelord :;

    Sammanfattning : The pattern matching problem is the problem of finding a set of sequential characters in a text of equal amount of characters or more. There are many applications for pattern matching algorithms e.g. search engines and databases. LÄS MER

  3. 2. Parallelising High OrderTransform of Point SpreadFunction and TemplateSubtraction for AstronomicImage Subtraction : The implementation of BACH

    Master-uppsats, Linköpings universitet/Informationskodning

    Författare :Annie Wång; Victor Lells; [2023]
    Nyckelord :Image Subtraction; HOTPANTS; SFFT; GPU; Parallelisation;

    Sammanfattning : This thesis explores possible improvements, using parallel computing, to the PSF-alignment and image subtraction algorithm found in HOTPANTS. In time-domain astronomy the PSF-alignment and image subtraction algorithm OIS is used to identify transient events. LÄS MER

  4. 3. A dynamic approach to sorting with respect to big data

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Filip Almström; [2023]
    Nyckelord :DynamicSort; sorting; dynamic; big data; comparing; characteristics; run-time;

    Sammanfattning : This study introduces a dynamic approach to sorting, making use of predictions and data gathered during run-time to optimize the sorting of the current data set. This approach is used to develop a sorting algorithm called DynamicSort which partitions data and calculates a partial standard deviation for each partition to determine which of two sorting algorithms should be used to sort the partition. LÄS MER

  5. 4. GPU-Based Path Optimization Algorithm in High-Resolution Cost Map with Kinodynamic Constraints : Using Non-Reversible Parallel Tempering

    Master-uppsats, Karlstads universitet/Fakulteten för hälsa, natur- och teknikvetenskap (from 2013)

    Författare :Daniel Greenberg; [2023]
    Nyckelord :;

    Sammanfattning : This thesis introduces a GPU-accelerated algorithm for path planning under kinodynamic constraints, focusing on navigation of flying vehicles within a high-resolution cost map. The algorithm operates by creating dynamically feasible initial paths, and a non-reversible parallel tempering Markov chain Monte Carlo scheme to optimize the paths while adhering to the nonholonomic kinodynamical constraints. LÄS MER

  7. 5. Simulating metal ct artefacts for ground truth generation in deep learning.

    Master-uppsats, Lunds universitet/Avdelningen för Biomedicinsk teknik

    Författare :Arthur Barakat; [2023]
    Nyckelord :Technology and Engineering;

    Sammanfattning : CT scanning stands as one of the most employed imaging techniques used in clinical field. In the presence of metal implants in the field of view (FOV), distortions and noise appear on the 3D image leading to inaccurate bone segmentation, often required for surgery planning or implant design. LÄS MER