2294 search results - page 109 / 459 » From Path Graphs to Directed Path Graphs |
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
124
click to vote
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
DELTA
2004
IEEE
15 years 1 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...