Search for dissertations about: "Distance of graph"

Showing result 1 - 5 of 35 swedish dissertations containing the words Distance of graph.

  2. 1. Random geometric graphs and their applications in neuronal modelling

    Author : Fioralba Ajazi; Matematisk statistik; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks;

    Abstract : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. READ MORE

  4. 2. Enhancement of Salient Image Regions for Visual Object Detection

    Author : Keren Fu; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; geodesic distance; graph spectral decomposition; video processing; visual attention; color contrast and distribution; propagation; salient region; figure-ground segmentation;

    Abstract : Salient object/region detection aims at finding interesting regions in images and videos, since such regions contain important information and easily attract human attention. The detected regions can be further used for more complicated computer vision applications such as object detection and recognition, image compression, content-based image editing, and image retrieval. READ MORE

  5. 3. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings

    Author : Martin Wahlén; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Approximation Algorithms; Exact Algorithms; Time Complexity; Broadcasting;

    Abstract : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. READ MORE

  6. 4. Localization using Distance Geometry : Minimal Solvers and Robust Methods for Sensor Network Self-Calibration

    Author : Martin Larsson; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; localization; TDOA; TOA; trilateration; multilateration; distance geometry; registration; sensor network self-calibration;

    Abstract : In this thesis, we focus on the problem of estimating receiver and sender node positions given some form of distance measurements between them. This kind of localization problem has several applications, e.g. READ MORE

  7. 5. Numerical study of flows related to aerated stirred tanks

    Author : Dragana Arlov; Strömningsteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; plasma; fluiddynamik; Gaser; plasmas; fluid dynamics; Gases; Lattice Boltzmann method; Volume of Fluid; Aerated stirred tank; Large Eddy Simulation; Eulerian-Lagrangian model; Energy research; Energiforskning; Mechanical engineering; hydraulics; vacuum technology; vibration and acoustic engineering; Maskinteknik; hydraulik; vakuumteknik; vibrationer; akustik;

    Abstract : The overall purpose with this work is to investigate the bubbly flow in a aerated stirred tank using numerical simulations. Aerated stirred tanks are commonly used in chemical processes for producing for example insulin and antibiotics. READ MORE