Sökning: "Multiplication"

Visar resultat 11 - 15 av 175 uppsatser innehållade ordet Multiplication.

1. 11. Tensor rank and support rank in the context of algebraic complexity theory

   Master-uppsats, KTH/Matematik (Avd.)

   Författare :Pelle Andersson; [2023]
   Nyckelord :linear algebra; tensor product; tensor rank; matrix multiplication; complexity; linjär algebra; tensorprodukt; tensorrang; matrismultiplikation; komplexitet;

   Sammanfattning : 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. LÄS MER

3. 12. Evaluation of Ferroelectric Tunnel Junction memristor for in-memory computation in real world use cases

   Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

   Författare :Alec Guerin; Christos Papadopoulos; [2023]
   Nyckelord :FTJ; Ferroelectric Tunneling Junction; Analog in-memory computing; AIMC; Memristor; A.I.; AIHWKIT; Semantic segmentation; Natural Language Processing; NLP; Neuromorphic Computing; Matrix Vector Multiplication; Technology and Engineering;

   Sammanfattning : Machine learning algorithms are experiencing unprecedented attention, but their inherent computational complexity leads to high energy consumption. However, a paradigm shift in computing methods has the potential to address the issue. LÄS MER

4. 13. Performance evaluation for choosing between Rust and C++

   Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för programvaruteknik

   Författare :Patrik Karlsson; [2023]
   Nyckelord :C ; Rust; evaluation;

   Sammanfattning : Developers face numerous challenges in their careers, including the critical decision of choosing the most suitable programming language to tackle these challenges. Each programming language presents its unique set of advantages and disadvantages, making the decision-making process complex. LÄS MER

5. 14. Zero Spectrum Subalgebras of K[x] Described by Higher Derivatives

   Kandidat-uppsats, Lunds universitet/Matematik LTH

   Författare :Erik Kennerland; [2023]
   Nyckelord :Algebra; Almost Monomial Subalgebra; Derivation; Lower Degree; Lower Semigroup; Subalgebra Spectrum; Truncation; Mathematics and Statistics;

   Sammanfattning : Unital subalgebras of finite codimension in the polynomial ring $\mathbb{K}[x]$ are described by a finite number of so called subalgebra conditions over a finite set in $\mathbb{K}$ named the subalgebra spectrum. Restricting attention to subalgebras whose spectrum is the singleton $\{0\}$ reveals a rather well behaved class of subalgebras, called almost monomial from the fact that these contain an ideal consisting of all monomials above a certain degree. LÄS MER

7. 15. Reverse Engineering of Deep Learning Models by Side-Channel Analysis

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Xuan Wang; [2023]
   Nyckelord :Side-Channel Attack; Deep Learning; Reverse Engineering; Perceptron Neural Network; Sidokanalattack; Djup lärning; Omvänd Konstruktion; Perceptron Neurala Nätverk;

   Sammanfattning : Side-Channel Analysis (SCA) aims to extract secrets from cryptographic systems by exploiting the physical leakage acquired from implementations of cryptographic algorithms. With the development of Deep Learning (DL), a new type of SCA called Deep Learning Side-Channel Analysis (DLSCA) utilizes the advantages of DL techniques in data features processing to break cryptographic systems more efficiently. LÄS MER