951 search results - page 23 / 191 » On the Computation of Correctly-Rounded Sums |
164
click to vote
COCO
2005
Springer
16 years 1 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
169
click to vote
CCCG
2008
15 years 8 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
156
click to vote
ACL
2001
15 years 8 months ago
2001
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
156
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
157
click to vote
FOCM
2011
2011
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
15 years 1 months ago
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...