76 search results - page 4 / 16 » New Results for Learning Noisy Parities and Halfspaces |
121
Voted
MICCAI
2005
Springer
16 years 14 days ago
2005
Springer
We present an automated algorithm for tissue segmentation of noisy, low contrast magnetic resonance (MR) images of the brain. We use a mixture model composed of a large number of G...
106
click to vote
FOCS
2008
IEEE
15 years 6 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 ...
ICPPW
2006
IEEE
15 years 5 months ago
2006
IEEE
Trust, the fundamental basis of ‘cooperation’ – one of the most important characteristics for the performance of pervasive ad hoc network-- is under serious threat with the ...
ML
1998
ACM
14 years 11 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
120
click to vote
STOC
2005
ACM
15 years 12 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...