Results 201 to 210 of about 92,871 (231)

Multi-Function Computation over a Directed Acyclic Network. [PDF]

Entropy (Basel)
Sun X, Zhang R, Li D, Guang X.
europepmc   +1 more source

The frequency response of networks as open systems. [PDF]

Nat Commun
Nazerian A, Asllani M, Tyloo M, Ku WL, Sorrentino F.   +4 more
europepmc   +1 more source

Childhood psychological abuse and neglect impair adolescent social-emotional competence: a network analysis with mediation. [PDF]

BMC Psychol
Liu L, Ning B, Yang L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Collapsibility for Directed Acyclic Graphs

Scandinavian Journal of Statistics, 2009
Abstract. Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for directed acyclic graphs (DAGs): estimate collapsibility, conditional independence collapsibility and model collapsibility. Related to collapsibility,
Xie, Xianchao, Geng, Zhi
openaire   +2 more sources

On counting homomorphisms to directed acyclic graphs

Journal of the ACM, 2006
It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes that lie strictly between them. Thus, if P ≠ NP, it is not possible to classify NP using any finite collection of complexity classes. This situation has led to attempts to identify smaller classes of problems within NP where
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson   +2 more
openaire   +2 more sources

On Mergings in Acyclic Directed Graphs

SIAM Journal on Discrete Mathematics, 2019
Summary: Consider an acyclic directed graph \(G\) with sources \(s_1, s_2, \ldots,s_n\) and sinks \(r_1, r_2, \ldots, r_n\). For \(i=1, 2, \ldots,n\), let \(c_i\) denote the size of the minimum edge cut between \(s_i\) and \(r_i\), which, by Menger's theorem, implies that there exists a group of \(c_i\) edge-disjoint paths from \(s_i\) to \(r_i ...
openaire   +1 more source

Directed Acyclic Graphs in Surgical Research

Journal of Surgical Research, 2023
Surgical research often utilizes multivariable regression to evaluate causal relationships between variables, but there is usually little explanation of the decision-making regarding which variables were controlled for. We propose that directed acyclic graphs (DAGs)-a formal logic tool that illustrates connections between variables-should be used to ...
AlleaBelle Gongola, Jace C. Bradshaw
openaire   +2 more sources

Retiming DAGs [direct acyclic graph]

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
This paper is devoted to a low-complexity algorithm for retiming circuits without cycles, i.e., those whose network graph is a direct acyclic graph (DAG). On one hand, DAGs have a great practical importance, as shown by the on-line arithmetic circuits used as a target application in this paper.
Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frédéric Vivien   +4 more
openaire   +1 more source

Recursive Processing of Directed Acyclic Graphs

2002
Recursive neural networks axe a new connectionist model particularly tailored to process Directed Positional Acyclic Graphs (DPAGs) [4]. While this assumption is reasonable in some applications, it introduces unnecessary constraints in others. In this paper, it is shown that the constraint on the ordering can be relaxed by using an appropriate weight ...
BIANCHINI M., GORI M., SCARSELLI F.
openaire   +2 more sources

Analyzing Directed Acyclic Graph Recombination

2001
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described.
Carlos Cotta, José M. Troya
openaire   +1 more source