6939 search results - page 863 / 1388 » Algorithm Engineering for Parallel Computation |
197
click to vote
COMPGEOM
1993
ACM
15 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
454
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
Much recent research [8, 6, 7] suggests significant power and energy benefits of relaxing correctness constraints in future processors. Such processors with relaxed constraints ...
179
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
176
click to vote
CLUSTER
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
186
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...