Sökning: "Directed acyclic graphs"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Directed acyclic graphs.

  1. 1. Chain Graphs : Interpretations, Expressiveness and Learning Algorithms

    Författare :Dag Sonntag; M. Jose Peña; Nahid Shahmehri; Jirka Vomlel; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Chain Graphs; Probabilitstic Grapical Models;

    Sammanfattning : Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. LÄS MER

  3. 2. Sparse Voxel DAGs for Shadows and for Geometry with Colors

    Författare :Dan Dolonius; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; directed acyclic graph; octree; compression; voxel; geometry; shadows; colors;

    Sammanfattning : Triangles are probably the most common format for shapes in computer graphics. Nevertheless, when high detail is desired, Sparse Voxel Octrees (SVO) and Sparse Voxel Directed Acyclic Graphs (DAG) can be considerably more memory efficient. One of the first practical use cases for DAGs was to use the structure to represent precomputed shadows. LÄS MER

  4. 3. Bayesian inference in probabilistic graphical models

    Författare :Felix Leopoldo Rios; Tatjana Pavlenko; Alun Thomas; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graphical models; Bayesian inference; predictive classification; decomposable graphs; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Sammanfattning : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. LÄS MER

  5. 4. All Around Logic Synthesis

    Författare :Maxim Teslenko; Hannu Tenhunen; Michel Berklaar; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph dominators; FPGA mapping; redundancy removal; RBN; Computer science; Datavetenskap;

    Sammanfattning : This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. LÄS MER

  7. 5. Foundation of Multi-Criteria Quality Scoring

    Författare :Maria Ulan; Anna Wingkvist; Harald Störrle; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Data- och informationsvetenskap; Computer and Information Sciences Computer Science;

    Sammanfattning : Software quality becomes more critical as our dependence on software increases. We need better quality assessment than ever. Comparison and ranking of software artifacts, detection of bad or good quality are important tasks for quality assessment.Software quality models are widely used to support quality assessment. LÄS MER