Sciweavers

1133 search results - page 146 / 227
» Basics of Graph Cuts
Sort
View
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
14 years 9 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...
DAC
2009
ACM
15 years 4 months ago
Information hiding for trusted system design
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
Junjun Gu, Gang Qu, Qiang Zhou
AGTIVE
2007
Springer
15 years 1 months ago
Visualization, Simulation and Analysis of Reconfigurable Systems
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
Claudia Ermel, Karsten Ehrig
ENTCS
2007
93views more  ENTCS 2007»
14 years 9 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 8 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...