Search for dissertations about: "Approximation Algorithms"

Showing result 1 - 5 of 77 swedish dissertations containing the words Approximation Algorithms.

  2. 1. Approximation Algorithms for Geometric Networks

    University dissertation from Department of Computer Science

    Author : Mattias Andersson; Lunds universitet.; Lund University.; Malmö University.; [2007]
    Keywords : TEKNIKVETENSKAP; TECHNOLOGY; TEKNIKVETENSKAP; TECHNOLOGY; systems; control; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap; Technology;

    Abstract : Det huvudsakliga bidraget i denna avhandling är approximationsalgoritmer för flera problem inom beräkningsgeometri. Den underliggande strukturen för de flesta problemen är ett geometriskt nätverk. READ MORE

  4. 2. Exact and approximation algorithms for graph problems with some biological applications

    University dissertation from Department of Computer Science

    Author : Eva-Marta Lundell; Lunds universitet.; Lund University.; [2009]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; MATEMATIK; MATHEMATICS; computational biology; Graph algorithms; 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

  5. 3. Some new randomized approximation algorithms

    University dissertation from Stockholm : Numerisk analys och datalogi

    Author : Gunnar Andersson; KTH.; [2000]
    Keywords : ;

    Abstract : .... READ MORE

  6. 4. Constructing Evolutionary Trees - Algorithms and Complexity

    University dissertation from Department of Computer Science

    Author : Anna Östlin; Lunds universitet.; Lund University.; [2001]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Maximum homeomorphic subtrees; Computer science; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Abstract : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. READ MORE

  7. 5. Algorithms in data mining using matrix and tensor methods

    University dissertation from Matematiska institutionen

    Author : Berkant Savas; Matematiska institutionen.; Tekniska högskolan.; [2008]
    Keywords : MATEMATIK; MATHEMATICS; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ;

    Abstract : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. READ MORE