951 search results - page 157 / 191 » On the Computation of Correctly-Rounded Sums |
131
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
A reduction is a computation in which a common operation, such as a sum, is to be performed across multiple pieces of data, each supplied by a separate task. We introduce phaser a...
128
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
118
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
150
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
159
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...