Sciweavers

288 search results - page 35 / 58
» random 1998
Sort
View
ICPADS
1998
IEEE
15 years 4 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
SAC
1998
ACM
15 years 4 months ago
Trading memory for disk bandwidth in video-on-demand servers
In a Video-on-Demand server, requests from different clients are independent of each other and may arrive at random time. Commercial systems may contain hundreds to thousands of c...
Weifeng Shi, Shahram Ghandeharizadeh
COLT
1998
Springer
15 years 4 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
87
Voted
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 4 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
90
Voted
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
15 years 4 months ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...