Sciweavers

248 search results - page 24 / 50
» Rate of Convergence for Constrained Stochastic Approximation...
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 12 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
NIPS
2007
13 years 9 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...
ICML
1999
IEEE
14 years 8 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
SAC
2008
ACM
13 years 7 months ago
Bayesian inference for a discretely observed stochastic kinetic model
The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observ...
Richard J. Boys, Darren J. Wilkinson, Thomas B. L....
TON
2008
139views more  TON 2008»
13 years 7 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli