Sciweavers

7064 search results - page 325 / 1413
» From States to Histories
Sort
View
CORR
2010
Springer
166views Education» more  CORR 2010»
15 years 7 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari
CORR
2010
Springer
77views Education» more  CORR 2010»
15 years 7 months ago
Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
Ishanu Chattopadhyay, Yicheng Wen, Asok Ray
IPL
2006
88views more  IPL 2006»
15 years 6 months ago
A note on the attractor-property of infinite-state Markov chains
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
182
Voted
CN
2004
89views more  CN 2004»
15 years 6 months ago
On the testability of SDL specifications
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
Robert M. Hierons, T.-H. Kim, Hasan Ural
NN
2011
Springer
217views Neural Networks» more  NN 2011»
14 years 9 months ago
A neurodynamical model for working memory
Neurodynamical models of working memory (WM) should provide mechanisms for storing, maintaining, retrieving, and deleting information. Many models address only a subset of these a...
Razvan Pascanu, Herbert Jaeger