Sciweavers

2294 search results - page 89 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
15 years 3 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
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, ...
CORR
2000
Springer
103views Education» more  CORR 2000»
14 years 9 months ago
Towards a query language for annotation graphs
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
Steven Bird, Peter Buneman, Wang Chiew Tan
DLT
2008
14 years 11 months ago
When Is Reachability Intrinsically Decidable?
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...
Barbara F. Csima, Bakhadyr Khoussainov
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 4 months ago
A novel criticality computation method in statistical timing analysis
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...
Feng Wang 0004, Yuan Xie, Hai Ju
ICPR
2006
IEEE
15 years 11 months ago
Combinatorial Surface Integration
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...
Edwin R. Hancock, Roberto Fraile