2585 search results - page 338 / 517 » computing 1999 |
119
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
158
click to vote
IEEEPACT
1999
IEEE
15 years 8 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
135
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
146
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
222
click to vote
ARTS
1999
Springer
15 years 8 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...