2294 search results - page 89 / 459 » From Path Graphs to Directed Path Graphs |
121
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
137
Voted
CORR
2000
Springer
15 years 2 months ago
2000
Springer
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
119
Voted
DLT
2008
15 years 4 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
108
Voted
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
91
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...