Sökning: "graph processing"

Visar resultat 1 - 5 av 62 avhandlingar innehållade orden graph processing.

  1. 1. Order-preserving graph grammars

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Sebastian Maneth; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph grammars; graph parsing; graph series; hyperedge replacement; uniform parsing problem; abstract meaning representation; semantic modelling; order preservation; reentrancy preservation; minimally adequate teacher; weighted graph grammars;

    Sammanfattning : The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. LÄS MER

  3. 2. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

    Författare :Mojtaba Mahdavi; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI Implementation; Hardware architectures; ASIC implementation; FPGA implementation; CMOS Technology; Baseband Processing; Massive MIMO; 5G New Radio; Beyond 5G; Co-Design; FFT processor; OFDM modulation; wireless communications; Massive MIMO Detection; Angular domain processing; Zero forcing; Systolic array; Non-linear detector; Channel Sparsity; Channel compression; Linear detector; Channel coding; Spatial coupling; Turbo-like codes; Spatially coupled serially concatenated codes; Threshold analysis; Decoder architecture; BCJR algorithm; MAP algorithm; Coupling memory; Window decoding; Complexity analysis; Performance Evaluation; Throughput; Decoding Latency; Silicon area; Design tradeoffs; Interleaver architecture; Memory requirements; Matrix multiplication; Channel state information CSI ; Cholesky decomposition; Tanner graph; Trellis codes; Convolutional encoder; Code design; Puncturing; Reordering circuit; wireless communication system; digital electronic;

    Sammanfattning : In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. LÄS MER

  4. 3. Salient Region Detection Methods with Application to Traffic Sign Recognition from Street View Images

    Författare :Keren Fu; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; normalized cut; traffic sign recognition; saliency propagation; color distribution; continuous conditional random field; manifold; Salient region detection; adaptive graph edge weights; color contrast; geodesics;

    Sammanfattning : In the computer vision community, saliency detection refers to modeling the selective mechanism in human visual attentions. Outputs of saliency detection algorithms are called saliency maps, which represent conspicuousness levels of different scene areas. LÄS MER

  5. 4. Performance Optimization Techniques and Tools for Distributed Graph Processing

    Författare :Vasiliki Kalavri; Vladimir Vlassov; Christian Schulte; Seif Haridi; Peter Van Roy; Peter Boncz; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Graph processing; distributed systems; big data; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : In this thesis, we propose optimization techniques for distributed graph processing. First, we describe a data processing pipeline that leverages an iterative graph algorithm for automatic classification of web trackers. LÄS MER

  7. 5. Graph-based Methods for Interactive Image Segmentation

    Författare :Filip Malmberg; Ingela Nyström; Ewert Bengtsson; Jayaram K. Udupa; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital image analysis; Interactive image segmentation; Fuzzy image segmentation; Image foresting transform; Graph labeling; Graph cuts; Computerized Image Processing; Datoriserad bildbehandling;

    Sammanfattning : The subject of digital image analysis deals with extracting relevant information from image data, stored in digital form in a computer. A fundamental problem in image analysis is image segmentation, i.e., the identification and separation of relevant objects and structures in an image. LÄS MER