951 search results - page 10 / 191 » On the Computation of Correctly-Rounded Sums |
69
Voted
ERSA
2007
14 years 11 months ago
2007
Molecular Dynamics simulations have become an interesting target for acceleration using Field-Programmable Gate Arrays (FPGA). Still to be attempted completely in FPGA hardware is...
CSE
2008
IEEE
14 years 10 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
GC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper we establish two symmetric identities on sums of products of Euler polynomials.
ANTS
2000
Springer
15 years 2 months ago
2000
Springer
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
—A serial sum-product architecture for low-density parity-check (LDPC) codes is presented. In the proposed architecture, a standard bit node processing unit computes the bit to c...