4074 search results - page 116 / 815 » Abstract Graph Transformation |
109
click to vote
MODELS
2007
Springer
15 years 7 months 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...
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones whic...
142
click to vote
TIP
2010
15 years 3 days 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 ...
115
click to vote
PLDI
2004
ACM
15 years 7 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...
147
click to vote
NETWORKS
2011
14 years 4 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...