1153 search results - page 102 / 231 » Reversing graph transformations |
MODELS
2007
Springer
15 years 6 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...
92
Voted
APLAS
2006
ACM
15 years 6 months 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...
128
click to vote
TIP
2010
14 years 11 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 ...
103
click to vote
PLDI
2004
ACM
15 years 6 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...
140
Voted
NETWORKS
2011
14 years 3 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...