Results 71 to 80 of about 62,209 (271)
Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT
In directed graphs, we investigate the problems of finding: 1) a minimum feedback vertex set (also called the Feedback Vertex Set problem, or MFVS), 2) a feedback vertex set inducing an acyclic graph (also called the Vertex 2-Coloring without ...
Rusu, Irena
core +2 more sources
Drawing directed acyclic graphs: An experimental study [PDF]
In this paper we consider the important class of directed acyclic graphs (DAGs), and present the results of a comparative study on four popular drawing algorithms specifically developed for them. The study has been performed within a general experimental setting consisting of two large test suites of DAGs and a set of quality measures.
DI BATTISTA, Giuseppe +7 more
openaire +3 more sources
Objective To examine the association between radiographic structural damage and physical function (PF) in psoriatic arthritis (PsA). Methods Data were analyzed from a large longitudinal PsA cohort. PF was measured using the Health Assessment Questionnaire (HAQ, 0–3) and Short Form‐36 PF subscale (SF‐36, 0–100); radiographic joint damage was measured ...
Pankti Mehta +8 more
wiley +1 more source
Importance of directed acyclic graphs in medical education
Medical students are taught the importance of variable relationships in scientific research. We propose augmenting this education with teaching about direct acyclic graphs (DAGs)—a graphical model used to analyze complex systems of variables.
AlleaBelle Bradshaw, Jace C. Bradshaw
doaj +1 more source
Markov Properties for Graphical Models with Cycles and Latent Variables [PDF]
We investigate probabilistic graphical models that allow for both cycles and latent variables. For this we introduce directed graphs with hyperedges (HEDGes), generalizing and combining both marginalized directed acyclic graphs (mDAGs) that can model ...
Forré, Patrick, Mooij, Joris M.
core +1 more source
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs [PDF]
Summary: We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of
Herrmann, Julien +4 more
openaire +2 more sources
Objective To estimate the prevalence of difficult‐to‐manage (D2M) and treatment‐refractory (TR) axSpA and to identify factors associated with D2M/TR disease in a longitudinal cohort. Methods We performed a cross‐sectional analysis on data from the Schroeder Arthritis Institute Spondylitis Program cohort.
Patricia Remalante‐Rayco +8 more
wiley +1 more source
Optimizing Iterative Data-Flow Scientific Applications Using Directed Cyclic Graphs
Data-flow programming models have become a popular choice for writing parallel applications as an alternative to traditional work-sharing parallelism. They are better suited to write applications with irregular parallelism that can present load imbalance.
David Alvarez, Vicenc Beltran
doaj +1 more source
Directed Acyclic Graphs With Tears
Bayesian network is a frequently-used method for fault detection and diagnosis in industrial processes. The basis of Bayesian network is structure learning which learns a directed acyclic graph (DAG) from data. However, the search space will scale super-exponentially with the increase of process variables, which makes the data-driven structure learning
Zhichao Chen, Zhiqiang Ge
openaire +2 more sources
ABSTRACT While the immediate benefits of labor epidural analgesia (LEA) are well established, recent studies have raised concerns about possible associations with autism spectrum disorder (ASD). Therefore, we examined the association between LEA and ASD in offspring.
Taniqua T. Ingol +7 more
wiley +1 more source

