5606 search results - page 1018 / 1122 » Randomization Techniques for Graphs. |
161
click to vote
IPL
2002
15 years 6 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
177
click to vote
IPL
1998
15 years 6 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
155
click to vote
JSA
1998
15 years 6 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
196
click to vote
MST
2002
15 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
168
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...