4074 search results - page 352 / 815 » Abstract Graph Transformation |
190
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
167
click to vote
MST
2010
15 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
265
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
181
Voted
ICSM
2009
IEEE
16 years 1 months ago
2009
IEEE
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
200
click to vote
APCCM
2009
15 years 7 months ago
2009
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...