Results 21 to 30 of about 14,176 (292)

Acyclic Partitioning of Large Directed Acyclic Graphs [PDF]

open access: yes2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2017
Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts should preserve an ...
Herrmann, Julien   +4 more
openaire   +4 more sources

Independencies Induced from a Graphical Markov Model After Marginalization and Conditioning: The R Package ggm

open access: yesJournal of Statistical Software, 2006
We describe some functions in the R package ggm to derive from a given Markov model, represented by a directed acyclic graph, different types of graphs induced after marginalizing over and conditioning on some of the variables.
Giovanni M. Marchetti
doaj   +3 more sources

Consensus mechanism design based on structured directed acyclic graphs

open access: yesBlockchain: Research and Applications, 2021
Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design.
Jiahao He   +3 more
doaj   +1 more source

Causation and decision: On Dawid’s “Decision theoretic foundation of statistical causality”

open access: yesJournal of Causal Inference, 2022
In a recent issue of this journal, Philip Dawid (2021) proposes a framework for causal inference that is based on statistical decision theory and that is, in many aspects, compatible with the familiar framework of causal graphs (e.g., Directed Acyclic ...
Pearl Judea
doaj   +1 more source

Hierarchy Depth in Directed Networks

open access: yesEntropy, 2022
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple measures are defined—rooted depth and relative depth—and their properties are discussed. The method of loop collapse is introduced, allowing investigation of
Krzysztof Suchecki, Janusz A. Hołyst
doaj   +1 more source

A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length

open access: yesAlgorithms, 2021
In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
Kunihiko Hiraishi
doaj   +1 more source

Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]

open access: yesTheoretiCS
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut   +2 more
doaj   +1 more source

Treemaps for Directed Acyclic Graphs [PDF]

open access: yes, 2008
Gene Ontology information related to the biological role of genes is organized in a hierarchical manner that can be represented by a directed acyclic graph (DAG). Treemaps graphically represent hierarchical information via a two-dimensional rectangular map. They efficiently display large trees in limited screen space.
Vassilis Tsiaras   +2 more
openaire   +1 more source

Reducing bias through directed acyclic graphs

open access: yesBMC Medical Research Methodology, 2008
Background The objective of most biomedical research is to determine an unbiased estimate of effect for an exposure on an outcome, i.e. to make causal inferences about the exposure.
Platt Robert W, Shrier Ian
doaj   +1 more source

MRC Directed Acyclic Graphs for Mendelian Randomisation

open access: yes, 2022
MRC Directed Acyclic Graphs for Mendelian ...
Nay Aung (11874419)
core   +1 more source

Home - About - Disclaimer - Privacy