Explore projects

labb3-4 TDDD80

Tidigare känt som TDDD63-LEGO-public

An extention of the randomized singular value decomposition (SVD) algorithm to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the original algorithm, the extended algorithm provides for a more efficient way of matrix factorization. The algorithm facilitates the low-rank approximation and principal component analysis (PCA) of off-center data matrices. When applied to different types of data matrices, our experimental results confirm the advantages of the extensions made to the original algorithm.

Course materials for 729A27/TDDE09 Natural Language Processing

Course materials for 729A27/TDDE09 Natural Language Processing

Course materials for 729A27/TDDE09 Natural Language Processing

Various code used by the humanoid lab at Linköping University