Sciweavers

360 search results - page 33 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
CSDA
2011
14 years 6 months ago
Approximate forward-backward algorithm for a switching linear Gaussian model
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
Hugo Hammer, Håkon Tjelmeland
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 12 days ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ECML
2005
Springer
15 years 5 months ago
Inducing Hidden Markov Models to Model Long-Term Dependencies
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
Jérôme Callut, Pierre Dupont
ATAL
2005
Springer
15 years 5 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
WISE
2006
Springer
15 years 5 months ago
Efficient Filtering Query Indexing in Data Stream
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
Ying Wang, Shuo Bai, Jianlong Tan, Li Guo