Results 1  10
of
1,977,855
Analyzing process models using graph reduction techniques
 Information Systems
, 2000
"... Abstract — The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflows, we show how a structural specification may contain deadlock and lack of synchronization conflicts that could compromise the correct execution of workflows. In ..."
Abstract

Cited by 123 (4 self)
 Add to MetaCart
. In general, identification of such conflicts is a computationally complex problem and requires development of effective algorithms specific for the target modeling language. We present a visual verification approach and algorithm that employs a set of graph reduction rules to identify structural conflicts
A Graph Reduction Technique with Sharing across Narrowings for FunctionalLogic Languages
 In Manuel Hermenegildo and Jaan Penjam, editors, Proceedings of the Sixth International Symposium on Programming Language Implementation and Logic Programming
, 1994
"... We present a system for the efficient implementation via graph reduction of functionallogic programming languages. In contrast to existing systems, ours allows sharing not only of fully common subexpressions but also of partially common expressions formed across narrowings, and allows both lazy and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of some restriction by a previous binding. Such backtracking will usually discard values computed since the original binding, but often some portion of those values will not be affected by the rebinding, and so must be recomputed wastefully. In this paper we present a setbased graph reduction technique
Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models
 In Proceedings of the 11th Conf on Advanced Information Systems Engineering (CAiSE'99
, 1999
"... . The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specification may contain certain structural conflicts that could compromise its correct execution. In general, identification of such c ..."
Abstract

Cited by 50 (3 self)
 Add to MetaCart
of such conflicts is a computationally complex problem and requires development of effective algorithms specific for target system language. We present a visual verification approach and algorithm that employs a set of graph reduction rules to identify structural conflicts in process models for a generic
Search the Set of Shorter Paths Using Graph Reduction Technique
"... The beauty of this paper is to clip a Graph provided by Geographic Information System (GIS) into levels (called Levelled Graph), and find the set of shorter paths with source at the very beginning level and destination node as the leaf nodes in the above level. This paper will formulate an algorithm ..."
Abstract
 Add to MetaCart
The beauty of this paper is to clip a Graph provided by Geographic Information System (GIS) into levels (called Levelled Graph), and find the set of shorter paths with source at the very beginning level and destination node as the leaf nodes in the above level. This paper will formulate
A Graph Reduction Technique and an Extension to the GMachine for Pure, Lazy FunctionalLogic Languages (Preliminary Report)
 In 6th International Symposium, Programming Language Implementation and Logic Programming
, 1994
"... We present a graph reduction technique for the implementation of functionallogic languages. Our technique, called quasisharing, attempts to provide a maximum degree of sharing between alternative narrowings while still admitting a reasonable compilation. Quasisharing resembles aspects of an algorit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a graph reduction technique for the implementation of functionallogic languages. Our technique, called quasisharing, attempts to provide a maximum degree of sharing between alternative narrowings while still admitting a reasonable compilation. Quasisharing resembles aspects
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
 Advances in Neural Information Processing Systems 14
, 2001
"... Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in a higher ..."
Abstract

Cited by 664 (8 self)
 Add to MetaCart
Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in a
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Secure Group Communications Using Key Graphs
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 552 (17 self)
 Add to MetaCart
management. We formalize the notion of a secure group as a triple (U; K;R) where U denotes a set of users, K a set of keys held by the users, and R a userkey relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 989 (3 self)
 Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
Results 1  10
of
1,977,855