11752 search results - page 2037 / 2351 » Those |
181
click to vote
FSE
1997
Springer
15 years 11 months ago
1997
Springer
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
194
click to vote
HPCN
1997
Springer
15 years 11 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
214
click to vote
ICALP
1997
Springer
15 years 11 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
212
click to vote
ASPLOS
1996
ACM
15 years 11 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
145
click to vote
CHI
1996
ACM
15 years 11 months ago
1996
ACM
The design of CSCW systems has often had its roots in ethnomethodological understandings of work and investigations of working settings. Increasingly, we are also seeing these ide...