Sciweavers

56 search results - page 10 / 12
» Tiled QR factorization algorithms
Sort
View
EUROCRYPT
2006
Springer
15 years 1 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
JPDC
2006
117views more  JPDC 2006»
14 years 10 months ago
Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions arising in quantum chemistry computati...
Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Ba...
ECAI
2006
Springer
15 years 1 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
FPL
2001
Springer
101views Hardware» more  FPL 2001»
15 years 2 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...