2303 search results - page 26 / 461 » Interior-Point Methods in Parallel Computation |
PPOPP
2009
ACM
16 years 8 days ago
2009
ACM
In this paper, we present a thorough analysis of thread-level parallelism available in production High Performance Computing (HPC) codes. We survey a number of techniques that are...
83
Voted
SPAA
1992
ACM
15 years 3 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
HPDC
2002
IEEE
15 years 4 months ago
2002
IEEE
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
DAM
2006
14 years 11 months ago
2006
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257
146
click to vote
AI
2011
Springer
14 years 3 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...