99 search results - page 2 / 20 » Communication Cost Reduction for Krylov Methods on Parallel ... |
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
— This paper proposes numerical algorithms for reducing the computational cost of semi-supervised and active learning procedures for visually guided mobile robots from O(M3 ) to ...
NCA
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
Assessing IC manufacturing process fluctuations and their impacts on IC interconnect performance has become unavoidable for modern DSM designs. However, the construction of parame...
ICS
1993
Tsinghua U.
13 years 8 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...