Sciweavers

290 search results - page 34 / 58
» Pseudorandom Bits for Polynomials
Sort
View

Publication
173views
15 years 6 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
R. Jain
HPCA
2006
IEEE
14 years 8 months ago
Probabilistic counter updates for predictor hysteresis and stratification
Hardware counters are a fundamental building block of modern high-performance processors. This paper explores two applications of probabilistic counter updates, in which the outpu...
Nicholas Riley, Craig B. Zilles
SOUPS
2009
ACM
14 years 3 months ago
Games for extracting randomness
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
Ran Halprin, Moni Naor
ICASSP
2008
IEEE
14 years 2 months ago
Robust video fingerprints based on subspace embedding
We present a novel video fingerprinting method based on subspace embedding. The proposed method is particularly robust against frame-rate conversion attacks and geometric attacks...
Regunathan Radhakrishnan, Claus Bauer
VTC
2008
IEEE
107views Communications» more  VTC 2008»
14 years 2 months ago
Channel Code Division Multiple Access and its Multilevel Structured LDPC Based Instantiation
— In this paper, we introduce and outline the concept of Channel Code Division Multiple Access (CCDMA) using a design example based on the recently proposed Multilevel Structured...
Nicholas Bonello, Rong Zhang, Sheng Chen, Lajos Ha...