14704 search results - page 215 / 2941 » computing 2007 |
104
Voted
MST
2007
15 years 3 months ago
2007
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server th...
117
Voted
ALENEX
2004
15 years 4 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
126
click to vote
CGVR
2006
15 years 4 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
129
Voted
CCCG
2009
15 years 4 months ago
2009
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
106
click to vote
AMC
2007
15 years 3 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...