6105 search results - page 65 / 1221 » A Parallel Algorithm for Bound-Smoothing |
115
click to vote
TRIER
2002
14 years 9 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
102
click to vote
PLDI
2012
ACM
13 years 6 days ago
2012
ACM
Research scientists and medical professionals use imaging technology, such as computed tomography (CT) and magnetic resonance imaging (MRI) to measure a wide variety of biological...
110
click to vote
ISCI
2002
14 years 9 months ago
2002
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
102
click to vote
EGH
2010
Springer
14 years 7 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
PARLE
1993
15 years 1 months ago
1993
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...