721 search results - page 20 / 145 » Graphs with Large Obstacle Numbers |
PRL
2007
13 years 9 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
PDP
2007
IEEE
14 years 3 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
SIGCOMM
1992
ACM
14 years 1 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
DAGM
2005
Springer
14 years 3 months ago
2005
Springer
Obstacle avoidance is one of the most important challenges for mobile robots as well as future vision based driver assistance systems. This task requires a precise extraction of de...
ICRA
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper proposes a hybrid approach to the problem of collision avoidance for indoor mobile robots. The DWA (short for: model-based dynamic window approach) integrates sensor dat...