15 search results - page 3 / 3 » Learning Intersections and Thresholds of Halfspaces |
COLT
1999
Springer
14 years 2 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
PERCOM
2008
ACM
14 years 10 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...
CVPR
2001
IEEE
15 years 11 days ago
2001
IEEE
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
SSDBM
2011
IEEE
13 years 2 months ago
2011
IEEE
The problem of privacy-preserving record linkage is to find the intersection of records from two parties, while not revealing any private records to each other. Recently, group li...