2498 search results - page 173 / 500 » Algorithms for the Topological Watershed |
139
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
153
click to vote
IJSYSC
2006
15 years 6 months ago
2006
: The paper deals with collision free path planning for industrial robotic manipulators. A new efficient algorithm is proposed that is based on a topologically ordered neural netwo...
176
click to vote
IPMI
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. We present a novel method for the segmentation of volumetric images, which is especially suitable for highly variable soft tissue structures. Core of the algorithm is a s...
180
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
166
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...