Sciweavers

4451 search results - page 446 / 891
» On Random Ordering Constraints
Sort
View
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 11 months ago
A Communication Scheduling Algorithm for Multi-FPGA Systems
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago
ITC
1999
IEEE
78views Hardware» more  ITC 1999»
15 years 11 months ago
Minimized power consumption for scan-based BIST
Power consumption of digital systems may increase significantly during testing. In this paper, systems equipped with a scan-based built-in self-test like the STUMPS architecture a...
Stefan Gerstendörfer, Hans-Joachim Wunderlich
156
Voted
SAC
1998
ACM
15 years 11 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
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 11 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....
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
15 years 11 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...