Blar i Department of Informatics på tittel
Viser treff 395-414 av 981
-
Implementation and Evaluationof a Fire Risk Indication Model
(Master thesis, 2019-06-29)During the winter seasons there will often be a higher risk house fires due tothe dry climate as the result of cold weather. The fire department, and otherclients, would therefore have benefit of a fire risk indication ... -
An implementation of a Feedback Vertex Set algorithm.
(Master thesis, 2013-06-03)An implementation, improvements to implementation and empirical results. Feedback Vertex Set on undirected and unweighted graphs. -
Implementering og evaluering av en HL7 FHIR integrasjonsbuss for kommunikasjon mellom klientapplikasjoner og e-helsesystemer
(Master thesis, 2017-07-11)Bakgrunn: Den økende digitaliseringen av helsetjenestene krever at informasjonen i de elektroniske pasientjournalene er klinisk strukturerte ved hjelp av datastandarder og kliniske terminologier for riktig prosessering av ... -
Improved Combinatorial Bounds and Enumerators for the Connected Vertex Cover and Independent Feedback Vertex Set Problems
(Master thesis, 2018-06-20)In this thesis we shall study both the maximum number of minimal connected vertex covers and the maximum number of minimal independent feedback vertex sets in graphs. A subset S of the vertices of a graph G is a vertex ... -
An improved workflow for image- and laser-based virtual geological outcrop modelling
(Doctoral thesis, 2013-03-15)Photorealistic 3D models, representing an object’s surface geometry textured with conventional photography, are used for visualization, interpretation and spatial measurement in many disparate fields, such as cultural ... -
Improvements and extensions to the configuration tools of the TaskManager HLT software in the ALICE experiment at CERN
(Master thesis, 2007)This thesis concerns work done to improve andextend software that is used to configure nodesand trigger software in HLT under the ALICEexperiment at CERN. HLT is a large computercluster that will be used to reduce data ... -
Improvements on making BKW practical for solving LWE
(Journal article; Peer reviewed, 2021)The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper ... -
Improving Efficiency in Parameter Estimation Using the Hamiltonian Monte Carlo Algorithm
(Master thesis, 2008)This thesis investigates three approaches to improve the performance of the Hamiltonian Monte Carlo algorithm. The first approach enhances the Hamiltonian Monte Carlo by suppressing random walk in the Gibbs sampling using ... -
Improving Interaction in Visual Analytics using Machine Learning
(Doctoral thesis, 2021-11-05)Interaction is one of the most fundamental components in visual analytical systems, which transforms people from mere viewers to active participants in the process of analyzing and understanding data. Therefore, fast and ... -
Improving Parallel Sparse Matrix-vector Multiplication
(Master thesis, 2013-12-19)Sparse Matrix-vector Multiplication (SMvM) is a mathematical technique encountered in many programs and computations and is often heavily used. Solving SMvM in parallel allows for bigger instances to be solved, and problems ... -
Improving the Usability of Refactoring Tools for Software Change Tasks
(Doctoral thesis, 2021-12-22)All successful software gets changed. Developers undertake software change tasks by editing the software’s source code to meet new demands. Often, the edits they make are aligned with refactorings and can be performed ... -
In silico design and analysis of targeted genome editing with CRISPR
(Doctoral thesis, 2020-01-27)CRISPR/Cas systems have become a tool of choice for targeted genome engineering in recent years. Scientists around the world want to accelerate their research with the use of CRISPR/Cas systems, but are being slowed down ... -
In Vitro Development of Human iPSC-Derived Functional Neuronal Networks on Laser-Fabricated 3D Scaffolds
(Journal article; Peer reviewed, 2021)Neural progenitor cells generated from human induced pluripotent stem cells (hiPSCs) are the forefront of ″brain-on-chip″ investigations. Viable and functional hiPSC-derived neuronal networks are shaping powerful in vitro ... -
The Inclusion Problem for Regular Expressions
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2010)This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the ... -
Incompleteness of the Inference System BNeg
(Master thesis, 2016-05-31)Any propositional discourse can be represented as a propositional theory in a specific form in such a way that the theory is inconsistent if and only if the discourse is paradoxical. Propositional theories in this form can ... -
Independent Set on P5-free graphs, an empirical study
(Master thesis, 2015-11-20)We implement the recent polynomial time algorithm for the independent set problem on P5-free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm is ... -
The index tracking problem with a limit on portfolio size
(Master thesis, 2014-11-19)For a passive fund manager tracking a benchmark, it is not uncommon to select some, and not all the assets in the index to his portfolio. In this thesis, we consider the problem of minimizing the tracking error under the ... -
Indexed and Fibred Structures for Hoare Logic
(Journal article; Peer reviewed, 2020)Indexed and fibred categorical concepts are widely used in computer science as models of logical systems and type theories. Here we focus on Hoare logic and show that a comprehensive categorical analysis of its axiomatic ... -
Indexed and fibered structures for partial and total correctness assertions
(Journal article; Peer reviewed, 2022)Hoare Logic has a long tradition in formal verification and has been continuously developed and used to verify a broad class of programs, including sequential, object-oriented, and concurrent programs. Here we focus on ...