Sökning: "Markov networks"

Visar resultat 1 - 5 av 52 avhandlingar innehållade orden Markov networks.

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

   Författare :Robert Mattila; Bo Wahlberg; Eric Moulines; KTH; []
   Nyckelord :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;

   Sammanfattning : 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. LÄS MER

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

   Författare :Per Sidén; Mattias Villani; Anders Eklund; Håvard Rue; Linköpings universitet; []
   Nyckelord :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;

   Sammanfattning : Accurate statistical analysis of spatial data is important in many applications. Failing to properly account for spatial autocorrelation may often lead to false conclusions. LÄS MER

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

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

   Sammanfattning : 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. LÄS MER

5. 4. Bayesian structure learning in graphical models

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

   Sammanfattning : 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. LÄS MER

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

   Författare :Ulf Ahlfors; Institutionen för elektro- och informationsteknik; []
   Nyckelord :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;

   Sammanfattning : 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. LÄS MER