79 search results - page 7 / 16 » Shortest path in a polygon using sublinear space |
112
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
150
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
140
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
123
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
114
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...