Sökning: "Conjugacy"

Visar resultat 1 - 5 av 10 avhandlingar innehållade ordet Conjugacy.

  1. 1. Sequential Monte Carlo methods for conjugate state-space models

    Författare :Anna Wigren; Fredrik Lindsten; Lawrence Murray; Riccardo Sven Risuleo; Simon Maskell; Uppsala universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Sequential Monte Carlo; Particle filter; Markov chain Monte Carlo; Conjugacy; State-space model; Probabilistic programming; Electrical Engineering with specialization in Signal Processing; Elektroteknik med inriktning mot signalbehandling;

    Sammanfattning : Bayesian inference in state-space models requires the solution of high-dimensional integrals, which is intractable in general. A viable alternative is to use sample-based methods, like sequential Monte Carlo, but this introduces variance into the inferred quantities that can sometimes render the estimates useless. LÄS MER

  3. 2. Exploiting conjugacy in state-space models with sequential Monte Carlo

    Författare :Anna Wigren; Fredrik Lindsten; Umberto Picchini; Uppsala universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Electrical Engineering with specialization in Signal Processing; Elektroteknik med inriktning mot signalbehandling;

    Sammanfattning : Many processes we encounter in our daily lives are dynamical systems that can be described mathematically using state-space models. Exact inference of both states and parameters in these models is, in general, intractable. LÄS MER

  4. 3. The k-assignment polytope, phylogenetic trees, and permutation patterns

    Författare :Jonna Gill; Jan Snellman; Axel Hultman; Bruce Sagan; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis three combinatorial problems are studied in four papers.In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the mxn (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. LÄS MER

  5. 4. Generalised Ramsey numbers and Bruhat order on involutions

    Författare :Mikael Hansson; Axel Hultman; Jan Snellman; Jonas Sjöstrand; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consists of two papers within two different areas of  combinatorics.Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. LÄS MER

  7. 5. Computing abelian varieties over finite fields

    Författare :Stefano Marseglia; Jonas Bergström; Christophe Ritzenthaler; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; abelian varieties; finite fields; period matrices; ideal classes; orders; number fields; integral matrices; Mathematics; matematik;

    Sammanfattning : In this thesis we address the problem of developing effective algorithms to compute isomorphism classes of polarized abelian varieties over a finite field and of fractional ideals of an order in a finite product of number fields.There are well-known methods to efficiently compute the classes of invertible ideals of an order in a number field, but not much has previously been known about non-invertible ideals. LÄS MER