563 search results - page 6 / 113 » Computing approximate PSD factorizations |
AAAI
2007
14 years 11 months ago
2007
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
SIAMMAX
2010
14 years 4 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
136
click to vote
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
AAAI
2012
12 years 12 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...