Essays about: "Beräkningsmässigt Effektiv"
Showing result 1 - 5 of 9 essays containing the words Beräkningsmässigt Effektiv.
-
1. Computationally Efficient Explainable AI: Bayesian Optimization for Computing Multiple Counterfactual Explanantions
University essay from KTH/Matematik (Avd.)Abstract : In recent years, advanced machine learning (ML) models have revolutionized industries ranging from the healthcare sector to retail and E-commerce. However, these models have become increasingly complex, making it difficult for even domain experts to understand and retrace the model's decision-making process. READ MORE
-
2. Computation of Underwater Acoustic Wave Propagation Using the WaveHoltz Iteration Method
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this thesis, we explore a novel approach to solving the Helmholtz equation,the WaveHolz iteration method. This method aims to overcome some ofthe difficulties with solving the Helmholtz equation by providing a highlyparallelizable iterative method based on solving the time-dependent Waveequation. READ MORE
-
3. Distilling Multilingual Transformer Models for Efficient Document Retrieval : Distilling multi-Transformer models with distillation losses involving multi-Transformer interactions
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Open Domain Question Answering (OpenQA) is a task concerning automatically finding answers to a query from a given set of documents. Language-agnostic OpenQA is an increasingly important research area in the globalised world, where the answers can be in a different language from the question. READ MORE
-
4. Efficient Music Thumbnailing for Genre Classification
University essay from KTH/Matematisk statistikAbstract : For music genre classification purposes, the importance of an intelligent and content-based selection of audio samples has been mostly overlooked. One common approach toward representative results is to select samples at predetermined locations. This is done to avoid analysis of the full audio during classification. READ MORE
-
5. An input-sample method for zonotopic obstacle avoidance with discrete-time control barrier functions
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this thesis, we consider the motion planning problem for an autonomous vehicle in an obstacle-cluttered environment approximated by zonotopes, and we propose an input sampling algorithm leveraging discrete-time control barrier function conditions (DCBF). Specifically, an optimization-based control barrier function that takes into account the geometric shapes of the vehicle and obstacles is constructed and verified. READ MORE