Results 231 to 240 of about 17,014 (265)

Flow graphs, signal flow graphs, and graph determinants

Proceedings of the IEE Part C: Monographs, 1962
The flow graph, introduced by C. L. Coates, is a structure, allied to the signal flow graph, which allows the solution of a system of linear equations to be found in a way which avoids certain redundancies. It is shown in the paper how the essential advantages of Coates's theory can be incorporated into signal-flow-graph analysis.
openaire   +1 more source

Characterizations of Reducible Flow Graphs

Journal of the ACM, 1974
It is established that if G is a reducible flow graph, then edge ( n, m ) is backward (a back latch) if and only if either n = m or m dominates n in G . Thus, the backward edges of a reducible flow
Matthew S. Hecht, Jeffrey D. Ullman
openaire   +2 more sources

Node flows in graphs with conservative flow

Acta Informatica, 1973
In analyzing graphs with conservative flow where the node flows are of interest (e.g. algorithm flowcharts) the practice has been to measure or to analytically determine the flows in the independent edges, and to calculate all other edge flows using Kirchhoff's law of flow conservation. The node flows are then obtained as the sum of edge flows entering
openaire   +2 more sources

The query-flow graph

Proceedings of the 17th ACM conference on Information and knowledge management, 2008
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to search engine results.
Paolo Boldi, Francesco Bonchi, Carlos Castillo 0001, Debora Donato, Aristides Gionis, Sebastiano Vigna   +5 more
openaire   +2 more sources

Traces of Control-Flow Graphs

2009
This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA.
Simone Campanoni, Stefano Crespi-Reghizzi   +1 more
openaire   +2 more sources

The performance of flow graph locking

IEEE Transactions on Software Engineering, 1990
The performance of flow graph locking (FGL) is compared with that of two-phase locking (2PL). As the data sharing level increases, FGL has a better response time than 2PL. Regardless of the data sharing or multiprogramming levels, FGL usually facilitates a better throughput rate than 2PL. >
Margaret H. Eich, Sharon M. Garard
openaire   +1 more source

Simplification of Signal Flow Graphs

Circuits, Systems, and Signal Processing, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Modulo Flows and Integer Flows in Signed Graphs

Journal of Graph Theory
ABSTRACTModulo flow is a powerful tool in the study of flows in both ordinary graphs and signed graphs. For ordinary graphs, Tutte showed that a graph admits a nowhere‐zero ‐flow if and only if it admits a nowhere‐zero ‐flow. However, such equivalence does not hold any more for signed graphs.
Miaomiao Han, Jiaao Li, You Lu 0002, Rong Luo   +3 more
openaire   +2 more sources

Flow Graph Representation

23rd ACM/IEEE Design Automation Conference, 1986
Alex Orailoglu, Daniel Gajski
openaire   +1 more source

Mining for Paths in Flow Graphs

2010
This paper presents FlowGSP, a data-mining algorithm that discovers frequent sequences of attributes in subpaths of a flow graph. FlowGSP was evaluated using flow graphs derived from the execution of transactions in the IBM® WebSphere® Application Server, a large real-world enterprise application server.
Adam Jocksch, José Nelson Amaral, Marcel Mitran   +2 more
openaire   +1 more source