Sciweavers

154 search results - page 5 / 31
» Optimization problems in multiple subtree graphs
Sort
View
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 5 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
FPL
2000
Springer
77views Hardware» more  FPL 2000»
13 years 9 months ago
Multiple-Wordlength Resource Binding
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 4 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
ICPR
2008
IEEE
14 years 7 months ago
Graph-based classification for multiple observations of transformed patterns
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
Effrosini Kokiopoulou, Pascal Frossard, Stefanos P...
JCO
2007
113views more  JCO 2007»
13 years 5 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin