1457 search results - page 43 / 292 » On the Uniform Distribution of Strings |
151
click to vote
NIPS
2008
15 years 7 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
136
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
132
click to vote
CRYPTO
1990
Springer
15 years 10 months ago
1990
Springer
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
129
click to vote
RSA
2008
15 years 5 months ago
2008
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
176
click to vote
ISPAN
2005
IEEE
15 years 11 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...