906 search results - page 33 / 182 » Map graphs |
NIPS
2004
15 years 1 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
121
click to vote
IPL
2008
14 years 11 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
177
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
DCG
2007
14 years 11 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...