1511 search results - page 103 / 303 » Hierarchical Graph Transformation |
161
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
160
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper proposes a new generic object recognition system based on multi-scale affineinvariant image regions. Image segments are obtained by a watershed transform of the princip...
145
click to vote
PARELEC
2006
IEEE
15 years 11 months ago
2006
IEEE
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
118
click to vote
SIGMOD
1996
ACM
15 years 9 months ago
1996
ACM
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
116
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...