Sciweavers

848 search results - page 118 / 170
» Randomness and the linear degrees of computability
Sort
View
DAC
2007
ACM
16 years 25 days ago
Synthesizing Stochasticity in Biochemical Systems
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
Brian Fett, Jehoshua Bruck, Marc D. Riedel
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 3 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 6 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
FSE
2007
Springer
101views Cryptology» more  FSE 2007»
15 years 6 months ago
Generalized Correlation Analysis of Vectorial Boolean Functions
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan...
IJCNN
2008
IEEE
15 years 6 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...