1508 search results - page 63 / 302 » Efficient Path Profiling |
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
102
click to vote
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
GRAPHICSINTERFACE
2009
14 years 9 months ago
2009
We present Drive, a system for the conceptual layout of 3D path networks. Our sketch-based interface allows users to efficiently author path layouts with minimal instruction. Our ...
101
click to vote
TIP
2010
14 years 6 months ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
FOCM
2002
14 years 11 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...