Essays about: "multiplikation"
Showing result 1 - 5 of 16 essays containing the word multiplikation.
-
1. Homomorphic encryption
University essay from KTH/Matematik (Avd.)Abstract : The problem of constructing a secure encryption scheme that allows for computation on encrypted data was an open problem for more than 30 years. In 2009, Craig Gentry solved the problem, constructing the first fully homomorphic encryption (FHE) scheme. READ MORE
-
2. Långsiktig torvnedbrytning för olika vegetationstyper på dikad skogsmark
University essay from SLU/School for Forest ManagementAbstract : Skogsklädda torvmarker i Sverige dikades i stor utsträckning mellan 1930- och 1980-talen i syfte att höja virkesproduktionen. Till följd av klimatproblemet har intresset för dikade torvmarkers bidrag till växthusgasutsläppen ökat under de senaste decennierna. READ MORE
-
3. Low-power Implementation of Neural Network Extension for RISC-V CPU
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Deep Learning and Neural Networks have been studied and developed for many years as of today, but there is still a great need of research on this field, because the industry needs are rapidly changing. The new challenge in this field is called edge inference and it is the deployment of Deep Learning on small, simple and cheap devices, such as low-power microcontrollers. READ MORE
-
4. Effects of Varying Precision on a FPGA using the SpMXV problem : A comparative study
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : With Moore’s Law slowing down, designing computer hardware that keeps up with the performance demands is becoming increasingly difficult. An interesting area of research is the Field Programmable Gate Array (FPGA) which is a re-programmable hardware device, and which might not be as dependent on Moore’s Law as other hardware. READ MORE
-
5. Tensor rank and support rank in the context of algebraic complexity theory
University essay from KTH/Matematik (Avd.)Abstract : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. READ MORE