Sciweavers

2612 search results - page 43 / 523
» Assemblies as Graph Processes
Sort
View
CVPR
1997
IEEE
14 years 9 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
IADIS
2008
13 years 9 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...
WSC
2007
13 years 10 months ago
Composability and component-based discrete event simulation
This work presents a framework and a Graphical User Interface, Viskit, for the creation and analysis of component-based Discrete Event Simulation models. Two primary elements of t...
Arnold H. Buss, Curtis L. Blais
EUROMICRO
1998
IEEE
13 years 12 months ago
Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
ICSM
2003
IEEE
14 years 27 days ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis