1389 search results - page 117 / 278 » Parallel Algorithms for Treewidth Two |
IPPS
1998
IEEE
15 years 2 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....
IPPS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
SSDBM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
84
Voted
ICPP
1999
IEEE
15 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
101
click to vote
ICPP
1998
IEEE
15 years 2 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...