1550 search results - page 71 / 310 » Benchmarking for Graph Transformation |
122
Voted
CSR
2008
Springer
15 years 4 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
113
Voted
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
128
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
100
click to vote
ACSC
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
116
click to vote
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...