951 search results - page 6 / 191 » On the Computation of Correctly-Rounded Sums |
JSC
2006
13 years 8 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
In an on-line statistical database, the query system should leave unanswered queries asking for sums that could lead to the disclosure of confidential data. To check that, every su...
FOCS
1991
IEEE
14 years 2 days ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
DCG
2008
13 years 8 months ago
2008
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...