3406 search results - page 341 / 682 » Computational models of classical conditioning |
176
click to vote
STORAGESS
2005
ACM
16 years 7 days ago
2005
ACM
The growing number of storage security breaches as well as the need to adhere to government regulations is driving the need for greater storage protection. However, there is the l...
218
click to vote
STOC
2000
ACM
15 years 11 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...
184
click to vote
NA
2007
15 years 6 months ago
2007
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
237
click to vote
SIAMJO
2011
14 years 9 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
195
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...