Results 161 to 170 of about 1,480,544 (205)

Likelihood Ratio Tests for a Large Directed Acyclic Graph [PDF]

Journal of the American Statistical Association, 2020
Wei Pan, Xiaotong Shen, Chunlin Li
exaly   +2 more sources

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   +3 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 Graph

, 2013
Directed Acyclic Graph of model for estimating flesh-footed shearwater population on Lord Howe Island. Rectangles represent derived variables, while ovals represent parameters that are estimated from data with uncertainty. Variables in italics were taken
Tim Reid (398306), Jennifer L. Lavers (398307), Chris Wilcox (191217), Mark Hindell (364276)   +3 more
openaire   +2 more sources

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   +3 more sources

Heuristic chaining in directed acyclic graphs

Computer Languages, 1993
Summary: We look at the problem of generating code with instruction chaining from directed acyclic graphs (DAGs). The problem is shown to be NP-complete. A simple heuristic for the problem is devised and its performance is compared with existing methods. The heuristic is shown to generate good code especially when the number of registers is large. Also
Venugopal, R, Srikant, YN
openaire   +1 more source

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   +2 more sources