1480 search results - page 167 / 296 » Distributed algorithms for weighted problems in sparse graph... |
105
Voted
RTSS
2003
IEEE
15 years 6 months ago
2003
IEEE
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
98
Voted
AAAI
2006
15 years 2 months ago
2006
Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as engineering, social science and biology. In this paper, we are concerned with c...
110
click to vote
SPAA
1993
ACM
15 years 4 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
113
Voted
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input...
101
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...