Blar i NTNU Open på forfatter "Hetland, Magnus Lie"
-
On the Creation of MipFlex. Extending JuMP and Aiding Solvers With Custom Recognition Procedures.
Andersen, Henriette (Master thesis, 2023)Denne oppgaven tar for seg design og implementasjon av en Julia modul, MipFlex, for å tas i bruk med JuMP, og som har som hensikt å kjenne igjen spesifike lineærprogrammer og løse de med skreddersydde algoritmer. Dette er ... -
On the Usage of Metaheuristic Optimization in Cryptanalysis
Høivik, Karl August (Master thesis, 2021)Denne oppgaven utforsker muligheten for å løse kryptografiske dekrypsjonsproblemer med optimaliseringsalgoritmer, ved å gjøre krypteringstekst til løsbare optimaliseringsproblemer, og deretter løse dem med et C++ rammeverk. -
Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem
Hetland, Magnus Lie (Chapter, 2020)In metric search, worst-case analysis is of little value, as the search invariably degenerates to a linear scan for ill-behaved data. Consequently, much effort has been expended on more nuanced descriptions of what performance ... -
Parameter-based online optimization in metric indexing using Bentley-Saxe transformations
Bakken, Jonas (Master thesis, 2021)Metrisk indeksering er et viktig verktøy for å kunne søke i store datamengder. Mange algoritmer og datastrukturer i dette feltet bruker en form for parameter i indekseringsprossessen. Det optimale valget for denne parameteren ... -
Protein function prediction using annotated protein-protein interaction networks
Braute, Petter; Rødsjø, Jorg Eliassen (Master thesis, 2005)Oppgaven presenterer teknikker og implementasjon for sammenlikning av naboskap av proteiner i protein-protein interaksjons-nettverk. -
Prototyping of a System for Online Energy Efficiency Ranking of Student Programs
Natvig, Simen (Master thesis, 2013)Programming competitions is found motivating by many students.Combining this with an increased need for green computing is the motivation of this project.The idea is to create an automated assessment system that not only ... -
Ptolemaic Indexing
Hetland, Magnus Lie (Journal article; Peer reviewed, 2015)This paper discusses a new family of bounds for use in similarity search, related to those used in metric indexing, but based on Ptolemy's inequality, rather than the metric axioms. Ptolemy's inequality holds for the ... -
Ptolemaic Indexing: An Evaluation
Reksten, Eirik Benum (Master thesis, 2010)Quadratic form distances adhere to the ptolemaic inequality, and is suitable for ptolemaic indexing. The thesis studies the performance of the eXtended Node Tree (X-tree) and the Pivoting Metric Tree (PM-tree) on quadratic ... -
Representing sets in C++: A practical investigation
Hagen, Lars Greger Nordland (Master thesis, 2014)The standard C++ classes for storing ordered sets and maps were created at a time when the latencies of the memory hierarchy were not as dominant a factor of performance as they are today. Consequently, the restrictions ... -
RustyGecko - Developing Rust on Bare-Metal - An experimental embedded software platform
Høiby, Håvard Wormdal; Lefsaker, Sondre (Master thesis, 2015)Embedded computer systems are an invisible, ever-growing part of our lives. Through market trends, like the Internet of Things, these computers are brought to new domains. These constrained systems set different requirements ... -
Similarity Search in Metric Spaces with Weighted Multi-Focal Regions: Using the Ambit Region Type to Improve the Performance of the SSS-Tree
Moe, Helene Haukås; Carlsen, Signe Marie Øen (Master thesis, 2020)Metrisk indeksering er et nyttig verktøy for å søke i store datamengder. For å lage metriske indekser, kan man dele datamengden inn i klynger. De fleste eksisterende klyngebaserte metriske indekseringsmetoder, blant disse ... -
Solving the Traveling Salesman Problem Using Binary Decision Diagrams
Visser, Ilse Gerda (Master thesis, 2017)The traveling salesman problem is one of the most well known NP-hard problems. Binary decision diagrams can be used in the process of finding an exact solution to traveling salesman problems. Previous methods using binary ... -
Threats to Bitcoin Software
Kateraas, Christian H (Master thesis, 2014)Collect and analyse threat models to the Bitcoin ecosystem and its software. The create misuse case, attack trees, and sequence diagrams of the threats. Create a malicious client from the gathered threat models. Once the ... -
Throughput Computing on Future GPUs
Hovland, Rune Johan (Master thesis, 2009)The general-purpose computing capabilities of the Graphics Processing Unit (GPU) have recently been given a great deal of attention by the High-Performance Computing (HPC) community. By allowing massively parallel applications ... -
A Timetable Solver Module - Based on Binary Integer Programming
Morland, Andreas Lowzow (Master thesis, 2014)In schools all over the world, weeks are spent each year trying to schedule timetables. These timetables usually follow specific rules, and have some restrictions they need to fulfill. By using an automated method for ... -
Towards a user-friendly natural language proof assistant - The outline of a system that can be used to implement applications that enable non-expert users to construct computer-verified natural language arguments
Barstad, Tor Økland (Master thesis, 2017)In more or less any discussion, however consequential, it is left for the participants to work out in their own head whether the arguments necessitate the conclusions put forward, or are lacking or flawed. When the discussion ... -
Towards Faster Development of Deep Learning Models Using Meta-Learning
Baklid, Martin; Barlaug, Nils (Master thesis, 2018)Deep learning has, in relatively few years, improved significantly the performance of many machine learning applications. Even though its popularity has surged, it's not always easy to apply deep learning to a real-world ... -
Trace-based just-in-time compiler for Haskell with RPython
Thomassen, Even Wiik (Master thesis, 2013)Can Haskell benefit from tracing JIT optimization techniques, and is the RPython translation toolchain suitable for purely functional, lazy languages such as Haskell? RPython has been used to implement VMs for many different ... -
Using machine learning to balance metric trees
Hagen, Erling (Master thesis, 2006)The emergence of complex data objects that must to be indexed and accessed in databases has created a need for access methods that are both dynamic and efficient. Lately, metric tree structures have become a popular way ... -
Using the Signature Quadratic Form Distance for Music Information Retrieval
Hitland, Håkon Haugdal (Master thesis, 2011)This thesis is an investigation into how the signature quadratic form distance can be used to search in music.Using the method used for images by Beecks, Uysal and Seidl as a starting point,I create feature signatures from ...