Sciweavers

1136 search results - page 181 / 228
» Learning with Weighted Transducers
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 9 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
IJON
2006
109views more  IJON 2006»
13 years 9 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
JMLR
2006
90views more  JMLR 2006»
13 years 9 months ago
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
Ron Begleiter, Ran El-Yaniv
LRE
2008
110views more  LRE 2008»
13 years 9 months ago
Automatic building of an ontology on the basis of text corpora in Thai
This paper presents a methodology for automatic learning of ontologies from Thai text corpora, by extraction of terms and relations. A shallow parser is used to chunk texts on whic...
Aurawan Imsombut, Asanee Kawtrakul
IJON
2002
98views more  IJON 2002»
13 years 8 months ago
Blind deconvolution by simple adaptive activation function neuron
The `Bussgang' algorithm is one among the most known blind deconvolution techniques in the adaptive signal processing literature. It relies on a Bayesian estimator of the sou...
Simone Fiori