6105 search results - page 956 / 1221 » A Parallel Algorithm for Bound-Smoothing |
159
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
157
click to vote
ICVGIP
2008
15 years 8 months ago
2008
The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with programming m...
180
click to vote
IMAMS
2003
15 years 8 months ago
2003
In this paper we describe a new shape-from-shading method. We show how the parallel transport of surface normals can be used to impose curvature consistency and also to iterativel...
164
click to vote
PPSC
1997
15 years 8 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
169
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...