6105 search results - page 984 / 1221 » A Parallel Algorithm for Bound-Smoothing |
180
click to vote
IS4TH
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we present a 3D reconstruction approach of a liver tumour model from a sequence of 2D MR parallel cross-sections, and the integration of this reconstructed...
192
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
177
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
147
click to vote
MATA
2001
Springer
15 years 11 months ago
2001
Springer
To overcome the shortcomings of existing IP networks and to facilitate the overall quality-of-service (QoS) provisioning in the near-future networks, new technologies such as Multi...
195
click to vote
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...