Sciweavers

1898 search results - page 75 / 380
» Weak Keys for IDEA
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 1 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
CE
2008
95views more  CE 2008»
13 years 9 months ago
Enabling teachers to explore grade patterns to identify individual needs and promote fairer student assessment
Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce fina...
Sorelle A. Friedler, Yee Lin Tan, Nir J. Peer, Ben...
JIB
2006
220views more  JIB 2006»
13 years 8 months ago
An assessment of machine and statistical learning approaches to inferring networks of protein-protein interactions
Protein-protein interactions (PPI) play a key role in many biological systems. Over the past few years, an explosion in availability of functional biological data obtained from hi...
Fiona Browne, Haiying Wang, Huiru Zheng, Francisco...
MCSS
2007
Springer
13 years 8 months ago
Lyapunov functions for time-varying systems satisfying generalized conditions of Matrosov theorem
The classical Matrosov theorem concludes uniform asymptotic stability of time varying systems via a weak Lyapunov function (positive definite, decrescent, with negative semidefi...
Frédéric Mazenc, Dragan Nesic
ASIACRYPT
2010
Springer
13 years 6 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel