On the capacity of associative memories with linear threshold functions

1989 ◽  
Vol 35 (4) ◽  
pp. 709-720 ◽  
Author(s):  
A. Dembo
1971 ◽  
Vol 8 (03) ◽  
pp. 573-588 ◽  
Author(s):  
Barry Belkin

The problem of computing the distribution of the time of first passage to a constant threshold for special classes of stochastic processes has been the subject of considerable study. For example, Baxter and Donsker (1957) have considered the problem for processes with stationary, independent increments, Darling and Siegert (1953) for continuous Markov processes, Mehr and McFadden (1965) for Gauss-Markov processes, and Stone (1969) for semi-Markov processes. The results, however, generally express the first passage distribution in terms of transforms which can be inverted only in a relatively few special cases, such as in the classical case of the Weiner process and for certain stable and compound Poisson processes. For linear threshold functions and processes with non-negative interchangeable increments the first passage problem has been studied by Takács (1957) (an explicit result was obtained by Pyke (1959) in the special case of a Poisson process). Again in the case of a linear threshold, an explicit form for the first passage distribution was found by Slepian (1961) for the Weiner process. For the Ornstein-Uhlenbeck process and certain U-shaped thresholds the problem has recently been studied by Daniels (1969).


Author(s):  
Sourav Chakraborty ◽  
Sushrut Karmalkar ◽  
Srijita Kundu ◽  
Satyanarayana V. Lokam ◽  
Nitin Saurabh

2012 ◽  
Vol 22 (3) ◽  
pp. 623-677 ◽  
Author(s):  
Ilias Diakonikolas ◽  
Rocco A. Servedio

2020 ◽  
Vol 1441 ◽  
pp. 012138
Author(s):  
Sh Fazilov ◽  
R Khamdamov ◽  
G Mirzaeva ◽  
D Gulyamova ◽  
N Mirzaev

Sign in / Sign up

Export Citation Format

Share Document