36 search results - page 5 / 8 » A Polynomial-Time Algorithm for Learning Noisy Linear Thresh... |
108
click to vote
PERCOM
2008
ACM
16 years 2 months ago
2008
ACM
We present a tamper-proof and lightweight challenge-response authentication scheme based on 2-level noisy Physically Unclonable Functions (PUF). We present a security reduction, w...
171
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
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...
110
Voted
ISDA
2009
IEEE
15 years 9 months ago
2009
IEEE
For supervised learning, feature selection algorithms attempt to maximise a given function of predictive accuracy. This function usually considers the ability of feature vectors t...
97
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
129
Voted
COLT
2003
Springer
15 years 7 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...