416 search results - page 30 / 84 » Processing Textbook-Style Matrices |
100
Voted
AAAI
2007
15 years 4 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...
104
Voted
EWRL
2008
15 years 4 months ago
2008
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
106
click to vote
ENTCS
2008
15 years 2 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
140
click to vote
SCN
2008
Springer
15 years 2 months ago
2008
Springer
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now,...
129
click to vote
MP
2002
15 years 1 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...