1480 search results - page 171 / 296 » Distributed algorithms for weighted problems in sparse graph... |
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
105
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
PODC
2003
ACM
15 years 6 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
110
click to vote
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...