Sciweavers

4544 search results - page 269 / 909
» Reinforcement Learning with Time
Sort
View
COLT
1992
Springer
14 years 2 months ago
Polynomial Time Inference of a Subclass of Context-Free Transformations
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 11 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 9 months ago
Discovering shared and individual latent structure in multiple time series
This paper proposes a nonparametric Bayesian method for exploratory data analysis and feature construction in continuous time series. Our method focuses on understanding shared fe...
Suchi Saria, Daphne Koller, Anna Penn
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 11 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
CONIELECOMP
2006
IEEE
14 years 4 months ago
Chaotic Time Series Approximation Using Iterative Wavelet-Networks
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
E. S. Garcia-Trevino, Vicente Alarcón Aquin...