549 search results - page 14 / 110 » Computing All the Best Swap Edges Distributively |
97
Voted
CCGRID
2007
IEEE
15 years 4 months ago
2007
IEEE
The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments. Many techniques to cons...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
CN
2000
14 years 9 months ago
2000
We introduce SPREAD - a new architecture for distributing and maintaining up-to-date Web content that simultaneously employs three different mechanisms: client validation, server ...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
DAM
2010
14 years 7 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...