Sökning: "graph matching"

Visar resultat 1 - 5 av 25 avhandlingar innehållade orden graph matching.

  1. 1. Helping robots help us : Using prior information for localization, navigation, and human-robot interaction

    Författare :Malcolm Mielle; Martin Magnusson; Achim Lilienthal; Erik Schaffernicht; Marjorie Skubic; Örebro universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph-based SLAM; prior map; sketch map; emergency map; map matching; graph matching; segmentation; search and rescue;

    Sammanfattning : Maps are often used to provide information and guide people. Emergency maps or floor plans are often displayed on walls and sketch maps can easily be drawn to give directions. However, robots typically assume that no knowledge of the environment is available before exploration even though making use of prior maps could enhance robotic mapping. LÄS MER

  3. 2. Covariate selection and propensity score specification in causal inference

    Författare :Ingeborg Waernbaum; Xavier de Luna; Elena Stanghellini; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Covariate selection; graphical models; matching; observational studies; treatment effects; unconfoundedness; Statistics; Statistik;

    Sammanfattning : This thesis makes contributions to the statistical research field of causal inference in observational studies. The results obtained are directly applicable in many scientific fields where effects of treatments are investigated and yet controlled experiments are difficult or impossible to implement. LÄS MER

  4. 3. On random cover and matching problems

    Författare :Joel Larsson; Klas Markström; Tatyana Turova; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Sammanfattning : This thesis consists of the following papers.I  J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII  V. Falgas-Ravry, J. LÄS MER

  5. 4. On random satisfiability and optimization problems

    Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

    Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

  7. 5. Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference

    Författare :Termeh Shafie; Ove Frank; Krzysztof Nowicki; Stockholms universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; multigraph; vertex labeled graph; edge labeled graph; isomorphism; edge multiplicity; simplicity and complexity; entropy; joint information; information divergence; goodness-of-fit; Statistics; statistik;

    Sammanfattning : This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. LÄS MER