3270 search results - page 107 / 654 » Approximate String Processing |
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
14 years 4 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
NPL
2008
13 years 10 months ago
2008
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...