Results 221 to 230 of about 17,014 (265)
Stochastic evolution model for international migration. [PDF]
PLoS OneZantout K, Schewe J.
europepmc +1 more source
Encrypted traffic classification encoder based on lightweight graph representation. [PDF]
Sci RepChen Z, Wei X, Wang Y.
europepmc +1 more source
Causal Inference Tools for Pharmacovigilance: Using Causal Graphs to Identify and Address Biases in Disproportionality Analysis. [PDF]
Drug SafFusaroli M +4 more
europepmc +1 more source
Acute temperature effects on cilia beating increase coral deoxygenation. [PDF]
Sci AdvPacherres CO +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1972
The structure of programs can often be described by a technique called “interval analysis” on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs. We then give a necessary and sufficient condition for analyzability and apply it to “goto-less programs ...
Matthew S. Hecht, Jeffrey D. Ullman
openaire +2 more sources
The structure of programs can often be described by a technique called “interval analysis” on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs. We then give a necessary and sufficient condition for analyzability and apply it to “goto-less programs ...
Matthew S. Hecht, Jeffrey D. Ullman
openaire +2 more sources
Combinatorica, 2007
A sufficient condition for graphs with circular flow index less than 4 is found in this paper. In particular, we give a simple proof of a result obtained by Galluccio and Goddyn (Combinatorica, 2002), and obtain a larger family of such graphs.
Hong-Jian Lai +2 more
openaire +1 more source
A sufficient condition for graphs with circular flow index less than 4 is found in this paper. In particular, we give a simple proof of a result obtained by Galluccio and Goddyn (Combinatorica, 2002), and obtain a larger family of such graphs.
Hong-Jian Lai +2 more
openaire +1 more source
Signal Flow Graphs and Data Flow Graphs
2010Signal processing programs differ from the traditional computing programs in the sense that these programs are referred to as non-terminating programs. In other words, input samples are processed periodically (typically with a certain iteration period or sampling period) and the tasks are repeated infinite number of times.
Keshab K. Parhi, Yanni Chen
openaire +1 more source
On the Modifications of Flow Graphs
Journal of the Society for Industrial and Applied Mathematics, 1965Graphs representing linear algebraic equations are known as flow graphs. If \(A\) is an \(n\) by \(n\) square matrix of coefficients, a graph on \(n\) vertices is associated with \(A\) as follows: an arc going from the vertex \(a_i\) to \(a_j\) appears with weight \(a_{ji}\) in the graph if and only if \(a_{ji} \ne 0\) in \(A\).
openaire +2 more sources
Journal of Combinatorial Theory, Series A
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Abreu, Marco Pacini, Matheus Secco
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Abreu, Marco Pacini, Matheus Secco
openaire +1 more source