1357 search results - page 109 / 272 » Compositionality in Graph Transformation |
151
click to vote
MODELS
2007
Springer
16 years 10 days ago
2007
Springer
In this paper we introduce a novel wide-profile graphical tool-building platform GrTP which is based on the principle of separating semantic domain model processing and user inter...
136
click to vote
APLAS
2006
ACM
16 years 5 days ago
2006
ACM
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...
197
click to vote
TIP
2010
15 years 4 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
163
click to vote
PLDI
2004
ACM
15 years 11 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...
226
click to vote
NETWORKS
2011
14 years 9 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...