2463 search results - page 201 / 493 » Rankings of Directed Graphs |
138
Voted
RSA
2008
15 years 3 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
175
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
130
click to vote
EMMCVPR
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the concept of complementarity between data and smoothness term in modern variational optic flow methods. First we design a sophisticated data term that incorporates ...
164
click to vote
VISSYM
2003
15 years 5 months ago
2003
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthog...
122
Voted
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...