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 ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
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...
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...
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...