Sciweavers

2612 search results - page 109 / 523
» Assemblies as Graph Processes
Sort
View
UML
2001
Springer
14 years 2 months ago
An Execution Algorithm for UML Activity Graphs
We present a real-time execution semantics for UML activity graphs that is intended for workflow modelling. The semantics is defined in terms of execution algorithms that define...
Rik Eshuis, Roel Wieringa
ICASSP
2009
IEEE
14 years 2 months ago
High-level feature extraction using SVM with walk-based graph kernel
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
Jean-Philippe Vert, Tomoko Matsui, Shin'ichi Satoh...
ENTCS
2008
62views more  ENTCS 2008»
13 years 10 months ago
Undecidable Control Conditions in Graph Transformation Units
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
Karsten Hölscher, Renate Klempien-Hinrichs, P...
BPM
2010
Springer
126views Business» more  BPM 2010»
13 years 8 months ago
Symbolic Execution of Acyclic Workflow Graphs
Abstract. We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workfl...
Cédric Favre, Hagen Völzer
FOCS
2002
IEEE
14 years 3 months ago
Global Information from Local Observation
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
Itai Benjamini, László Lovász