Search for dissertations about: "graph theory in computer"

Showing result 1 - 5 of 30 swedish dissertations containing the words graph theory in computer.

  2. 1. Advances in Functional Decomposition: Theory and Applications

    Author : Andrés Martinelli; Elena Dubrova; Jon Muzio; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; computer science; electronic system design; Boolean decomposition; binary decision diagram; logic synthesis; graph algorithm; Computer science; Datavetenskap;

    Abstract : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. READ MORE

  4. 2. Higher-Order Regularization in Computer Vision

    Author : Johannes Ulén; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer Vision; Regularization; Segmentation; Dense Stereo;

    Abstract : At the core of many computer vision models lies the minimization of an objective function consisting of a sum of functions with few arguments. The order of the objective function is defined as the highest number of arguments of any summand. READ MORE

  5. 3. Exact and approximation algorithms for graph problems with some biological applications

    Author : Eva-Marta Lundell; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Abstract : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. READ MORE

  6. 4. Skew-symmetric matrix pencils : stratification theory and tools

    Author : Andrii Dmytryshyn; Bo Kågström; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : Investigating the properties, explaining, and predicting the behaviour of a physical system described by a system (matrix) pencil often require the understanding of how canonical structure information of the system pencil may change, e.g., how eigenvalues coalesce or split apart, due to perturbations in the matrix pencil elements. READ MORE

  7. 5. 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