Results 261 to 270 of about 14,176 (292)
Some of the next articles are maybe not open access.

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

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   +4 more
openaire   +1 more source

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

Use of directed acyclic graphs (DAGs) to identify confounders in applied health research: review and recommendations

International Journal of Epidemiology, 2021
Peter W G Tennant   +2 more
exaly  

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data

INFORMS Journal on Optimization, 2021
Hasan Manzour   +2 more
exaly  

Directed Acyclic Graph CRDTs

Proceedings of the 12th Workshop on Principles and Practice of Consistency for Distributed Data
Evelyn Borth   +2 more
openaire   +1 more source

Episode directed acyclic subsequence graph

Nord. J. Comput., 2004
Summary: Given two strings, pattern \(P\) and text \(T\), episode substring of \(P\) in \(T\) is a minimal substring of \(T\) that contains \(P\) as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very ...
openaire   +1 more source

Directed acyclic graphs can help understand bias in indirect and mixed treatment comparisons

Journal of Clinical Epidemiology, 2012
Jeroen P Jansen   +2 more
exaly  

Signed Directed Acyclic Graphs for Causal Inference

Journal of the Royal Statistical Society Series B: Statistical Methodology, 2010
Tyler J Vanderweele, James M Robins
exaly  

Home - About - Disclaimer - Privacy