874 search results - page 65 / 175 » Graph Transformation in a Nutshell |
127
Voted
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
172
Voted
NETWORKS
2011
14 years 6 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
255
Voted
3DIM
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
129
Voted
ACMMSP
2004
ACM
15 years 9 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
145
Voted
MODELS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...