314 search results - page 40 / 63 » Arithmetic Coding Revisited |
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
111
click to vote
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Wavelet transform coefficient encoders are broadly categorized as depending on correlations: across sub-bands through a zerotree, or within sub-bands through a block quad-tree. Th...