Search for dissertations about: "Markov networks"

Showing result 1 - 5 of 52 swedish dissertations containing the words Markov networks.

  2. 1. Hidden Markov models : Identification, control and inverse filtering

    Author : Robert Mattila; Bo Wahlberg; Eric Moulines; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; hidden markov models; system identification; method of moments; inverse filtering; abdominal aortic aneurysm; medical; markov decision process; structure; Electrical Engineering; Elektro- och systemteknik;

    Abstract : The hidden Markov model (HMM) is one of the workhorse tools in, for example, statistical signal processing and machine learning. It has found applications in a vast number of fields, ranging all the way from bioscience to speech recognition to modeling of user interactions in social networks. READ MORE

  4. 2. Scalable Bayesian spatial analysis with Gaussian Markov random fields

    Author : Per Sidén; Mattias Villani; Anders Eklund; Håvard Rue; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Spatial statistics; Bayesian statistics; Gaussian Markov random fields; fMRI; Machine learning; Spatial statistik; Bayesiansk statistik; Gaussiska Markov-fält; fMRI; Maskininlärning;

    Abstract : Accurate statistical analysis of spatial data is important in many applications. Failing to properly account for spatial autocorrelation may often lead to false conclusions. READ MORE

  5. 3. On Perfect Simulation of Markovian Queueing Networks with Blocking

    Author : Dan Mattsson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Markov chain; Monte Carlo methods; Propp-Wilson algorithm; perfect simulation; queueing theory; Jackson networks; birth and death processes; Jackson networks;

    Abstract : Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this monograph. The network processes defined are modelled by restricted multivariate birth and death processes with intensities depending on a random environment. The random environments are mainly a set of independent onoff processes. READ MORE

  6. 4. Bayesian structure learning in graphical models

    Author : Felix Leopoldo Rios; Tatjana Pavlenko; Klas Markström; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Bayesian statistics; graphical models; Bayesian networks; Markov networks; structure learning; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Abstract : This thesis consists of two papers studying structure learning in probabilistic graphical models for both undirected graphs anddirected acyclic graphs (DAGs).Paper A, presents a novel family of graph theoretical algorithms, called the junction tree expanders, that incrementally construct junction trees for decomposable graphs. READ MORE

  7. 5. Dynamic Traffic Control in Multiservice Networks - Applications of Decision Models

    Author : Ulf Ahlfors; Institutionen för elektro- och informationsteknik; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Distributed-Memory Systems; Overload Control; Call Admission Control; Routing; Optimization; Multiservice Networks; Markov Decision Process; Telecommunication engineering; Telekommunikationsteknik;

    Abstract : In this thesis, we develop and examine decision models intended for traffic engineering analysis of multiservice networks. Two important issues are addressed, namely call admission and routing control in multiservice broadband networks, and overload control in distributed-memory systems. READ MORE