4074 search results - page 222 / 815 » Abstract Graph Transformation |
152
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
170
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
172
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
168
click to vote
EJC
2010
15 years 6 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
170
click to vote
CAI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...