6005 search results - page 47 / 1201 » Graph-Theoretical Methods in Computer Vision |
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Mobile robots need maps or other forms of geometric information about the environment to navigate. The mobility sensors (LADAR, stereo, etc.) on these robotic vehicles ...
TASE
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--We present a robotic manipulation system for automated selection and transfer of individual living cells to analysis locations. We begin with a commonly used cell transfe...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
GG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
FOCS
2004
IEEE
14 years 13 days ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...