432 search results - page 36 / 87 » Internally deterministic parallel algorithms can be fast |
117
click to vote
DEM
2001
Springer
15 years 6 months ago
2001
Springer
With the advances in rendering hardware, it is possible to render very complex scenes in real-time. In general, computers do not have enough memory to store all the necessary infor...
141
click to vote
WFLP
2009
Springer
15 years 8 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
108
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
139
click to vote
FTCS
1993
15 years 3 months ago
1993
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
132
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...