721 search results - page 4 / 145 » Graphs with Large Obstacle Numbers |
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
RIDE
2002
IEEE
14 years 2 months ago
2002
IEEE
Technologies and approaches in the field of Electronic Commerce are not mature enough in order to allow for their broad successful commercial application. Neither existing, succes...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
ARSCOM
2008
13 years 9 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
JGT
2010
13 years 8 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...