951 search results - page 13 / 191 » On the Computation of Correctly-Rounded Sums |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
101
click to vote
CGF
2010
14 years 10 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
90
Voted
ICCSA
2007
Springer
15 years 2 months ago
2007
Springer
Network-on-Chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future System-on-Chi...