Sökning: "algorithmic complexity"

Visar resultat 1 - 5 av 14 uppsatser innehållade orden algorithmic complexity.

1. 1. ASSESSING PUBLIC OPINION ON ALGORITHMIC FAIRNESS Reviewing practical challenges and the role of contextual factors

   Master-uppsats, Institutionen för tillämpad informationsteknologi

   Författare :Veronica Kecki; [2023-02-01]
   Nyckelord :AI; artificial intelligence; ML; machine learning; algorithms; algorithmic decision-making; fairness; socio-technical design; AI ethics;

   Sammanfattning : AI ethicists often claim that where algorithmic decision-making is impacting human lives, it is crucial to strive for transparency and explainability. As one form of achieving these, some authors have argued for socio-technical design of AI systems that involves the user in the design process. LÄS MER

3. 2. Pricing and Hedging American-Style Options withDeep Learning: Algorithmic implementation

   Master-uppsats, Uppsala universitet/Analys och partiella differentialekvationer

   Författare :Mohammed Moniruzzaman Khan; [2023]
   Nyckelord :;

   Sammanfattning : This thesis aims at evaluating and implementing Longstaff & Schwarz approach for approximating the value of American options. American options are generally hard to value, exercised at any time up to its expiration and moreover, there is no closed- form solution for an American option’s price. LÄS MER

4. 3. Exploiting Spatial Redundancy and Approximate Computing for Area Efficient Image Compression

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

   Författare :Saurav Arjun; [2022]
   Nyckelord :Image Compression; VLSI; Spatial redundancy; DCT; Compression; System Verilog; Technology and Engineering;

   Sammanfattning : Owing to the intensive computation involved in the Discrete Cosine Transform during image com- pression, the design of the efficient hardware architectures for fast computation of the transform has become imperative, especially for real-time applications. Although fast computation techniques have been able to minimise the hardware computation complexity to a certain limit, they could further extend the research to figure out the interesting approaches which can be implemented on applications where power, speed and area are crucial factors to determine the performance of the system. LÄS MER

5. 4. Analyzing the Negative Log-Likelihood Loss in Generative Modeling

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

   Författare :Aleix Espuña I Fontcuberta; [2022]
   Nyckelord :Generative modeling; Normalizing flows; Generative Adversarial Networks; MaximumLikelihood Estimation; Real Non-Volume Preserving flow; Fréchet Inception Distance; Misspecification; Generativa metoder; Normalizing flows; Generative adversarial networks; Maximum likelihood-metoden; Real non-volume preserving flow; Fréchet inception distance; felspecificerade modeller;

   Sammanfattning : Maximum-Likelihood Estimation (MLE) is a classic model-fitting method from probability theory. However, it has been argued repeatedly that MLE is inappropriate for synthesis applications, since its priorities are at odds with important principles of human perception, and that, e.g. LÄS MER

7. 5. Graph Complexity Based on a Heuristic That Involves the Algorithmic Complexity Behaviour of Multiplex Networks on Graphs

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

   Författare :Hasan Kalzi; [2021]
   Nyckelord :;

   Sammanfattning : Since determining the complexity of multiplex networks is an NP-hard problem, I decided to calculate the complexity of graphs using heuristics. I am the first in this path who did these kinds of calculations. I always wanted to define complexity as a mathematical characteristic in the structure of graphs. LÄS MER