2642 search results - page 82 / 529 » Merge-by-Wire: Algorithms and System Support |
121
click to vote
JDA
2006
15 years 1 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
TJS
2008
15 years 1 months ago
2008
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
119
click to vote
JGAA
2000
15 years 1 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
114
click to vote
TCS
2010
14 years 12 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
123
Voted
QOFIS
2000
Springer
15 years 5 months ago
2000
Springer
Many distributed multimedia applications have the ability to adapt to uctuations in the network conditions. By adjusting temporal and spatial quality to available bandwidth, or man...