Sciweavers

36887 search results - page 61 / 7378
» Are We All In the Same
Sort
View
SC
2005
ACM
14 years 2 months ago
Optimizing All-to-All Collective Communication by Exploiting Concurrency in Modern Networks
The paper proposes a novel approach for optimizing performance of all-to-all collective communication by taking advantage of concurrency available in modern networks such as Infin...
Vinod Tipparaju, Jarek Nieplocha
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 28 days ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
ICASSP
2010
IEEE
13 years 9 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
GLOBECOM
2008
IEEE
13 years 9 months ago
Efficient Power-Aware Network Provisioning for All-Optical Multicasting in WDM Mesh Networks
Optimal network provisioning is the process of equipping the network with the devices and resources needed to support all traffic demands while minimizing the network cost. Optical...
Ashraf M. Hamad, Ahmed E. Kamal
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
13 years 9 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh