2294 search results - page 255 / 459 » From Path Graphs to Directed Path Graphs |
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
110
click to vote
IPL
2007
15 years 3 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
109
Voted
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
124
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
99
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— Precise calibration of camera intrinsic and extrinsic parameters, while often useful, is difficult to obtain during field operation and presents scaling issues for mu...