Essays about: "algorithmic complexity"
Showing result 6 - 10 of 13 essays containing the words algorithmic complexity.
-
6. Design parameterizable filter using High Level Synthesis
University essay from Lunds universitet/Institutionen för elektro- och informationsteknikAbstract : As the ASIC designs continue to grow in complexity, traditional RTL level of abstraction is becoming a productivity bottleneck. The RTL design process requires extensive time and effort for verification of algorithmic correctness as well as correct timing and interface behavior. READ MORE
-
7. Polypharmacy Side Effect Prediction with Graph Convolutional Neural Network based on Heterogeneous Structural and Biological Data
University essay from KTH/Numerisk analys, NAAbstract : The prediction of polypharmacy side effects is crucial to reduce the mortality and morbidity of patients suffering from complex diseases. However, its experimental prediction is unfeasible due to the many possible drug combinations, leaving in silico tools as the most promising way of addressing this problem. READ MORE
-
8. DSP Design With Hardware Accelerator For Convolutional Neural Networks
University essay from Lunds universitet/Institutionen för elektro- och informationsteknikAbstract : Convolutional Neural Networks impressed the world in 2012 by reaching state-of-the-art accuracy levels in the ImageNet Large Scale Visual Recognition Challenge. The era of machine learning has arrived and with it countless applications varying from autonomous driving to unstructured robotic manipulation. READ MORE
-
9. Constructions for efficient MDS diffusion layers
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)Abstract : Matrices are widely used in Block Cipher Diffusion layers, usually chosen for offering maximal branch numbers, and allowing lightweight hardware implementations through their low XOR Count. When implemented in software however, is XOR Count the only metric? This project will utilize the parallelism provided by modern SIMD vector instructions to evaluate metrics, by implementing different algorithmic approaches. READ MORE
-
10. On the performance of edge coloring algorithms for cubic graphs
University essay from Lunds universitet/Institutionen för datavetenskapAbstract : This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select a set of algorithms that are among the asymptotically fastest known today. Each algorithm has exponential time complexity, owing to the NP-completeness of edge coloring, but their space complexities differ greatly. READ MORE
