Sökning: "graph matching"

Visar resultat 1 - 5 av 21 uppsatser innehållade orden graph matching.

  1. 1. Decoding the surface code using graph neural networks

    Master-uppsats, Göteborgs universitet / Institutionen för fysik

    Författare :Moritz Lange; [2023-10-17]
    Nyckelord :;

    Sammanfattning : Quantum error correction is essential to achieve fault-tolerant quantum computation in the presence of noisy qubits. Among the most promising approaches to quantum error correction is the surface code, thanks to a scalable two-dimensional architecture, only nearest-neighbor interactions, and a high error threshold. Decoding the surface code, i.e. LÄS MER

  3. 2. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic

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

    Författare :Yannick Stade; [2022]
    Nyckelord :graph language; formal language; theoretical computer science;

    Sammanfattning : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. LÄS MER

  4. 3. Quantum Error Correction Using Graph Neural Networks

    Master-uppsats, Göteborgs universitet / Institutionen för fysik

    Författare :Valdemar Bergentall; [2021-06-17]
    Nyckelord :Quantum error correction; surface code; graph neural networks;

    Sammanfattning : A graph neural network (GNN) is constructed and trained with a purpose of using it as a quantum error correction decoder for depolarized noise on the surface code. Since associating syndromes on the surface code with graphs instead of grid-like data seemed promising, a previous decoder based on the Markov Chain Monte Carlo method was used to generate data to create graphs. LÄS MER

  5. 4. Chromosomal DNA Barcode Assembly Using Hierarchical Clustering Matrix Method: Including Elastic Matching

    Kandidat-uppsats, Lunds universitet/Beräkningsbiologi och biologisk fysik - Genomgår omorganisation

    Författare :Erik Clarkson; [2020]
    Nyckelord :DNA barcoding; Physics and Astronomy;

    Sammanfattning : Obtaining DNA sequences is a time-consuming task, which typically requires one or several days for completion. One way of reducing analysis times is to be satisfied with long-range sequence patterns on the order of thousands of base pairs. DNA barcoding is a DNA-characterising technique that works according to this principle. LÄS MER

  7. 5. Map-aided localization for autonomous driving using a particle filter

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Simon Eriksson; [2020]
    Nyckelord :Particle filter; Monte Carlo filter; Gaussian noise; Bayesian estimation; probabilistic localization; autonomous vehicles; Scania; OpenStreetMap; Partikelfilter; Monte Carlo-filter; Gaussiskt brus; Bayesisk uppskattning; sannolikhetsbaserad lokalisering; autonoma fordon; Scania; OpenStreetMap;

    Sammanfattning : Vehicles losing their GPS signal is a considerable issue for autonomous vehicles and can be a danger to people in their vicinity. To circumvent this issue, a particle filter localization technique using pre-generated offline Open Street Map (OSM) maps was investigated in a software simulation of Scania’s heavy-duty trucks. LÄS MER