951 search results - page 48 / 191 » On the Computation of Correctly-Rounded Sums |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge s...
GC
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
ICMS
2010
14 years 9 months ago
2010
We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle...
WSCG
2004
14 years 12 months ago
2004
A major drawback of shopping for clothes on-line is that the customer cannot try on clothes and see if they fit or suit them. One solution is to display clothing on an avatar, a 3...
ICIP
2002
IEEE
16 years 5 days ago
2002
IEEE
We propose a novel multiresolution-multigrid based signal reconstruction method from arbitrarily spaced samples. The signal is reconstructed on a uniform grid using B-splines basi...