123 search results - page 16 / 25 » Derandomizing from Random Strings |
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Peptide mass fingerprinting is a technique to identify a protein from its fragment masses obtained by mass spectrometry after enzymatic digestion. Recently, much attentio...
131
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
127
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
103
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...