Sciweavers

12194 search results - page 371 / 2439
» Numberings Optimal for Learning
Sort
View
NIPS
1997
15 years 8 months ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
NC
2006
132views Neural Networks» more  NC 2006»
15 years 6 months ago
Learning short multivariate time series models through evolutionary and sparse matrix computation
Multivariate Time Series (MTS) data are widely available in different fields including medicine, finance, bioinformatics, science and engineering. Modelling MTS data accurately is...
Stephen Swift, Joost N. Kok, Xiaohui Liu
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
15 years 5 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup
TNN
2010
176views Management» more  TNN 2010»
15 years 1 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ISQED
2010
IEEE
114views Hardware» more  ISQED 2010»
16 years 1 months ago
Toward effective utilization of timing exceptions in design optimization
— Timing exceptions in IC implementation processes, especially timing verification, help reduce pessimism that arises from unnecessary timing constraints by masking non-function...
Kwangok Jeong, Andrew B. Kahng, Seokhyeong Kang