Search for dissertations about: "Approximation algorithm"

Showing result 6 - 10 of 202 swedish dissertations containing the words Approximation algorithm.

  2. 6. Signal Processing Techniques in Mobile Communication Systems : Signal Separation, Channel Estimation and Equalization

    Author : Ronnie Landqvist; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; wireless mobile communications; signal processing; blind source separation; independent component analysis; beamforming; water filling; greedy algorithm; exact eigendecomposition; eigenvector algorithm; multiple-input multiple-output systems; the projection approximation subspace tracking algorithm with and without deflation; linear and non-linear principal component analysis; whitening; decorrelation; equalization; antenna arrays;

    Abstract : Over the last decade there has been an explosive growth in the use of wireless mobile communications. Second generations systems are mature technologies now and third generation systems and beyond are being implemented and researched. READ MORE

  4. 7. Estimation of Nonlinear Latent Variable and Mixture Models

    Author : Johan Vegelius; Shaobo Jin; Fan Yang-Wallentin; Melanie Wall; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; structural equation modeling; semiparametric; EM algorithm; adaptive Gauss-Hermite quadrature approximation; Laplace approximation; zero inflation; Statistics; Statistik;

    Abstract : In this thesis methods are developed for estimation of latent variable models. In particular nonlinear structural equation models are estimated in the presence of ordinal data and mixture models for count data. READ MORE

  5. 8. Numerical analysis for random processes and fields and related design problems

    Author : Konrad Abramowicz; Oleg Seleznjev; Krzysztof Podgórski; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; stochastic processes; random fields; approximation; numerical integration; Hermite splines; piecewise linear interpolator; local stationarity; point singularity; stratified Monte Carlo quadrature; Asian option; Monte Carlo pricing method; Lévy market models; Mathematical statistics; Matematisk statistik; Mathematical Statistics; matematisk statistik;

    Abstract : In this thesis, we study numerical analysis for random processes and fields. We investigate the behavior of the approximation accuracy for specific linear methods based on a finite number of observations. Furthermore, we propose techniques for optimizing performance of the methods for particular classes of random functions. READ MORE

  6. 9. Consensus Algorithms for Trees and Strings

    Author : Jesper Jansson; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; computational complexity; Approximation algorithm; labeled tree; lowest common ancestor constraint; maximum agreement subtree; alignment between trees; clustering; Computer science; Hamming metric; systems; control; Datalogi; numerisk analys; system; kontroll;

    Abstract : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. READ MORE

  7. 10. Numerical Complexity Analysis of Weak Approximation of Stochastic Differential Equations

    Author : Raul Tempone Olariaga; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Adaptive methods; a posteriori error estimates; stochastic differential equations; weak approximation; Monte Carlo methods; Malliavin Calculus; HJM model; option price; bond market; stochastic elliptic equation; Karhunen-Loeve expansion; numerical co; Numerical analysis; Numerisk analys;

    Abstract : The thesis consists of four papers on numerical complexityanalysis of weak approximation of ordinary and partialstochastic differential equations, including illustrativenumerical examples. Here by numerical complexity we mean thecomputational work needed by a numerical method to solve aproblem with a given accuracy. READ MORE