6105 search results - page 880 / 1221 » A Parallel Algorithm for Bound-Smoothing |
169
click to vote
APCSAC
2000
IEEE
15 years 11 months ago
2000
IEEE
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...
164
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
163
click to vote
ICDAR
1997
IEEE
15 years 11 months ago
1997
IEEE
An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided int...
185
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
180
click to vote
3DPVT
2006
IEEE
15 years 10 months ago
2006
IEEE
Thanks to their high performance and programmability, the latest graphics cards can now be used for scientific purpose. They are indeed very efficient parallel Single Instruction ...