Sciweavers

4498 search results - page 714 / 900
» How to Invent Functions
Sort
View
JSAC
1998
126views more  JSAC 1998»
15 years 3 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 3 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
NN
1998
Springer
102views Neural Networks» more  NN 1998»
15 years 3 months ago
Modeling parietal-premotor interactions in primate control of grasping
Visual information is processed in the posterior parietal cortex for the hypothesized purpose of extracting a variety of affordances for the generation of motor behavior. The term...
Andrew H. Fagg, Michael A. Arbib
NN
1998
Springer
15 years 3 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
PE
1998
Springer
158views Optimization» more  PE 1998»
15 years 3 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier