Sciweavers

6028 search results - page 841 / 1206
» Randomness as a resource for design
Sort
View
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
15 years 11 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 11 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
SACRYPT
1998
Springer
257views Cryptology» more  SACRYPT 1998»
15 years 11 months ago
Cryptanalysis of RC4-like Ciphers
Abstract. RC4, a stream cipher designed by Rivest for RSA Data Security Inc., has found several commercial applications, but little public analysis has been done to date. In this p...
Serge Mister, Stafford E. Tavares
ICCAD
1996
IEEE
151views Hardware» more  ICCAD 1996»
15 years 11 months ago
Expected current distributions for CMOS circuits
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper...
Dennis J. Ciplickas, Ronald A. Rohrer
ISCA
1994
IEEE
93views Hardware» more  ISCA 1994»
15 years 11 months ago
RAID-II: A High-Bandwidth Network File Server
In 1989, the RAID (Redundant Arrays of Inexpensive Disks) group at U. C. Berkeley built a prototype disk array called RAID-I. The bandwidth delivered to clients by RAID-I was seve...
Ann L. Drapeau, Ken Shirriff, John H. Hartman, Eth...