549 search results - page 3 / 110 » Computing All the Best Swap Edges Distributively |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
KDD
2006
ACM
15 years 10 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We present reliability solutions for adaptable Network RAM systems running on general-purpose clusters. Network RAM allows nodes with over-committed memory to swap pages...
CJ
1999
14 years 9 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...