1511 search results - page 123 / 303 » Hierarchical Graph Transformation |
121
Voted
APLAS
2006
ACM
15 years 11 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...
175
click to vote
TIP
2010
15 years 3 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 ...
145
click to vote
PLDI
2004
ACM
15 years 10 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...
192
Voted
NETWORKS
2011
14 years 7 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...
279
click to vote
3DIM
2007
IEEE
15 years 11 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...