Sciweavers

4934 search results - page 381 / 987
» complexity 2008
Sort
View
TIP
1998
109views more  TIP 1998»
15 years 6 months ago
Optimum design of chamfer distance transforms
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
Muhammad Akmal Butt, Petros Maragos
TIT
1998
55views more  TIT 1998»
15 years 6 months ago
On the Trellis Representation of the Delsarte-Goethals Codes
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
Yaron Shany, Ilan Reuven, Yair Be'ery
TIT
1998
126views more  TIT 1998»
15 years 6 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron
TNN
1998
92views more  TNN 1998»
15 years 6 months ago
Inductive inference from noisy examples using the hybrid finite state filter
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
Marco Gori, Marco Maggini, Enrico Martinelli, Giov...
TNN
1998
112views more  TNN 1998»
15 years 6 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu