Sökning: "Graph processing"
Visar resultat 1 - 5 av 61 avhandlingar innehållade orden Graph processing.
1. Order-preserving 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
2. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design
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
3. Salient Region Detection Methods with Application to Traffic Sign Recognition from Street View Images
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
4. Performance Optimization Techniques and Tools for Distributed Graph Processing
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
5. Graph-based Methods for Interactive Image Segmentation
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