11016 search results - page 707 / 2204 » Cloud Computing for Science |
185
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
172
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
190
click to vote
SOFSEM
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern re...
154
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
155
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...