951 search results - page 81 / 191 » On the Computation of Correctly-Rounded Sums |
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
125
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
113
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
130
click to vote
CGI
2004
IEEE
15 years 7 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
131
click to vote
CVPR
2004
IEEE
15 years 7 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...