In this paper we study two problems which have a provable gap between their randomized and deterministic complexity; oblivious routing on fixed connection Ε½ . networks and finding the median on a parallel comparison tree PCT . We prove a trade-off between the amount of randomness used by an algorith
Trade-offs between Communication Throughput and Parallel Time
β Scribed by Yishay Mansour; Noam Nisan; Uzi Vishkin
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 141 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Scaled Gaussian analysis multirate filter banks (MRBs) are analysis MRBs whose filters are Gaussians scaled differently in width and height. They are frequently employed in image processing and visual systems modeling. We define generalized scaled Gaussian analysis MRBs for both parallel and hierarc
We consider the problem ofschedulingcustomer orders on a single facility where each order consists of several jobs that can be clustered into several groups. When a facility is changed over to another group, a setup time associated with the new group is required. Two particular problems are consider
Economic analysis is increasingly being employed in formal resource allocation decision-making processes in health care. As a consequence, the methods employed by economic analysts are increasingly subject to close scrutiny. One such area of methodology concerns the instruments used to elicit prefer