Results 1  10
of
40,137
Analyzing process models using graph reduction techniques
 INFORMATION SYSTEMS
, 2000
"... 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 general, i ..."
Abstract

Cited by 127 (4 self)
 Add to MetaCart
, 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 in process models
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
Laplacian eigenmaps and spectral techniques for embedding and clustering.
 Proceeding of Neural Information Processing Systems,
, 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator 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 ..."
Abstract

Cited by 668 (7 self)
 Add to MetaCart
Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator 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
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1406 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
, 2003
"... One of the central problems in machine learning and pattern recognition is to develop appropriate representations for complex data. We consider the problem of constructing a representation for data lying on a lowdimensional manifold embedded in a highdimensional space. Drawing on the correspondenc ..."
Abstract

Cited by 1226 (15 self)
 Add to MetaCart
on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for representing the highdimensional data. The algorithm provides a computationally efficient approach to nonlinear dimensionality
What energy functions can be minimized via graph cuts?
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are co ..."
Abstract

Cited by 1047 (23 self)
 Add to MetaCart
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Results 1  10
of
40,137