Search for dissertations about: "sequential sampling"
Showing result 16 - 20 of 44 swedish dissertations containing the words sequential sampling.
-
16. Sequential Monte Carlo Methods with Applications to Positioning and Tracking in Wireless Networks
Abstract : This thesis is based on 5 papers exploring the filtering problem in non-linear non-Gaussian state-space models together with applications of Sequential Monte Carlo (also called particle filtering) methods to the positioning in wireless networks. The aim of the first paper is to study the performance of particle filtering techniques in mobile positioning using signal strength measurements. READ MORE
-
17. Simulation-based Inference : From Approximate Bayesian Computation and Particle Methods to Neural Density Estimation
Abstract : This doctoral thesis in computational statistics utilizes both Monte Carlo methods(approximate Bayesian computation and sequential Monte Carlo) and machine-learning methods (deep learning and normalizing flows) to develop novel algorithms for inference in implicit Bayesian models. Implicit models are those for which calculating the likelihood function is very challenging (and often impossible), but model simulation is feasible. READ MORE
-
18. Particle filters and Markov chains for learning of dynamical systems
Abstract : Sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) methods provide computational tools for systematic inference and learning in complex dynamical systems, such as nonlinear and non-Gaussian state-space models. This thesis builds upon several methodological advances within these classes of Monte Carlo methods. READ MORE
-
19. Capillary driven devices for patient-centric diagnostics
Abstract : Lateral flow assays is an example of a successful microfluidic platform relying on passive fluid transport, making them suitable for patient-centric and point-of-care applications. Flow control and valving in capillary driven devices typically rely on design-imprinted functions and operations which can be a limiting factor. READ MORE
-
20. Bayesian structure learning in graphical models
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