6800 search results - page 355 / 1360 » On optimizing collective communication |
184
Voted
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
189
click to vote
WICON
2008
15 years 8 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
198
Voted
TIT
2008
15 years 6 months ago
2008
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
146
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
The need for video summarization originates primarily from a viewing time or a bit budget constraint. A shorter version of the original video sequence is desirable in a number of ...
154
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...