199 search results - page 31 / 40 » Fast Algorithms for Computing Tree LCS |
104
click to vote
JAIR
2011
14 years 6 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
DAC
2003
ACM
16 years 19 days ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
CAIP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We propose a framework for fast and automated initialization of segmentation algorithms in Computed Tomography images. Based on the idea that time-consuming voxel classi...
JPDC
2008
14 years 11 months ago
2008
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...