scholarly journals Re: "Methods of Covariate Selection: Directed Acyclic Graphs and the Change-in-Estimate Procedure"

2009 ◽  
Vol 170 (10) ◽  
pp. 1320-1320 ◽  
Author(s):  
L. Nie
Keyword(s):  
Directed Acyclic Graphs ◽  
Covariate Selection ◽  
Acyclic Graphs ◽  
Estimate Procedure ◽  
Re Methods

scholarly journals Methods of Covariate Selection: Directed Acyclic Graphs and the Change-in-Estimate Procedure

2009 ◽  
Vol 169 (10) ◽  
pp. 1182-1190 ◽  
Author(s):  
H.-Y. Weng ◽  
Y.-H. Hsueh ◽  
L. L. McV. Messam ◽  
I. Hertz-Picciotto
Keyword(s):  
Directed Acyclic Graphs ◽  
Covariate Selection ◽  
Acyclic Graphs ◽  
Estimate Procedure

scholarly journals Directed acyclic graphs: An under-utilized tool for child maltreatment research

2019 ◽  
Vol 91 ◽  
pp. 78-87 ◽  
Author(s):  
Anna E. Austin ◽  
Tania A. Desrosiers ◽  
Meghan E. Shanahan
Keyword(s):  
Child Maltreatment ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

scholarly journals On directed analogues of expander and hyperfinite graph sequences

2021 ◽  
pp. 1-14
Author(s):  
Endre Csóka ◽  
Łukasz Grabowski
Keyword(s):  
Directed Acyclic Graphs ◽  
Acyclic Graphs ◽  
Probabilistic Construction

Abstract We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call ‘extender’ and ‘hypershallow’ graph sequences, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences.

PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

2002 ◽  
Vol 13 (06) ◽  
pp. 873-887
Author(s):  
NADIA NEDJAH ◽  
LUIZA DE MACEDO MOURELLE
Keyword(s):  
Programming Languages ◽  
Pattern Matching ◽  
Term Rewriting ◽  
Directed Acyclic Graphs ◽  
Tree Automaton ◽  
Minimal Tree ◽  
Term Rewriting Systems ◽  
Rewriting Systems ◽  
Acyclic Graphs ◽  
Space Requirements

We compile pattern matching for overlapping patterns in term rewriting systems into a minimal, tree matching automata. The use of directed acyclic graphs that shares all the isomorphic subautomata allows us to reduce space requirements. These are duplicated in the tree automaton. We design an efficient method to identify such subautomata and avoid duplicating their construction while generating the dag automaton. We compute some bounds on the size of the automata, thereby improving on previously known equivalent bounds for the tree automaton.

Sign in / Sign up

Export Citation Format

Share Document