1096 search results - page 41 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
CATA
2000
14 years 11 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
IBPRIA
2003
Springer
15 years 3 months ago
2003
Springer
Many segmentation techniques are available in the literature and some of them have been widely used in different application problems. Most of these segmentation techniques were mo...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper proposes numerical algorithms for reducing the computational cost of semi-supervised and active learning procedures for visually guided mobile robots from O(M3 ) to ...
101
click to vote
CODES
2010
IEEE
14 years 7 months ago
2010
IEEE
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...