Search for dissertations about: "deterministic graph"

Showing result 6 - 10 of 19 swedish dissertations containing the words deterministic graph.

  2. 6. Applications in Monocular Computer Vision using Geometry and Learning : Map Merging, 3D Reconstruction and Detection of Geometric Primitives

    Author : David Gillsjö; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Scene Completion; Deep Learning; Bayesian Neural Network; Room Layout Estimation; Line Segment Detection; Polygon Detection; Graph Neural Network; Map Merging; Structure from Motion; Minimal Solvers; Wireframe Estimation;

    Abstract : As the dream of autonomous vehicles moving around in our world comes closer, the problem of robust localization and mapping is essential to solve. In this inherently structured and geometric problem we also want the agents to learn from experience in a data driven fashion. READ MORE

  4. 7. On Approximating Asymmetric TSP and Related Problems

    Author : Anna Palbom; Mikael Goldmann; Lars Engebretsen; Peter Jonsson; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Komplexity theory; algorithms; approxiamtion; Computer science; Datalogi;

    Abstract : In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, these choices need to be specified. READ MORE

  5. 8. Improvements in High-Coverage and Low-Power LBIST

    Author : Nan Li; Elena Dubrova; Krishnendu Chakrabarty; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : Testing cost is one of the major contributors to the manufacturing cost of integrated circuits. Logic Built-In Self Test (LBIST) offers test cost reduction in terms of using smaller and cheaper ATE, test data volume reduction due to on-chip test pattern generation, test time reduction due to at-speed test pattern application. READ MORE

  6. 9. On Directed Random Graphs and Greedy Walks on Point Processes

    Author : Katja Gabrysch; Svante Janson; Takis Konstantopoulos; Thomas Mountford; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Directed random graphs; Tracy-Widom distribution; Poisson-weighted infinite tree; Greedy walk; Point processes;

    Abstract : This thesis consists of an introduction and five papers, of which two contribute to the theory of directed random graphs and three to the theory of greedy walks on point processes.          We consider a directed random graph on a partially ordered vertex set, with an edge between any two comparable vertices present with probability p, independently of all other edges, and each edge is directed from the vertex with smaller label to the vertex with larger label. READ MORE

  7. 10. Type Domains for Abstract Interpretation : A critical study

    Author : Per Mildner; Jonas Barklund; Håkan Millroth; Roland Bol; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

    Abstract : Programming languages with dynamic typing such as Prolog do not require that the programmer declares the types of data or procedures. This flexibility, however, comes at a price. The lack of declarations makes it hard for a compiler to produce fast code since data must be assumed to be of any type. READ MORE