Search for dissertations about: "Data points"

Showing result 1 - 5 of 1066 swedish dissertations containing the words Data points.

  2. 1. Efficient concurrent data structure access parallelism techniques for increasing scalability

    Author : Adones Rukundo; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; FIFO queue; parallelism; performance modelling; design framework; semantic relaxation; Data structure; multi-access; lock free; performance analysis; counter; concurrency; search tree.; stack; multi-core processor; priority queue;

    Abstract : Multi-core processors have revolutionised the way data structures are designed by bringing parallelism to mainstream computing. Key to exploiting hardware parallelism available in multi-core processors are concurrent data structures. READ MORE

  4. 2. Benchmarking Points-to Analysis

    Author : Tobias Gutzmann; Welf Löwe; Jonas Lundberg; Sibylle Schupp; Linnéuniversitetet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Points-to Analysis; Dataflow Analysis; Static Analysis; Dynamic Analysis; Gold Standard; Software Technology; Programvaruteknik;

    Abstract : Points-to analysis is a static program analysis that, simply put, computes which objects created at certain points of a given program might show up at which other points of the same program. In particular, it computes possible targets of a call and possible objects referenced by a field. READ MORE

  5. 3. Offline and Online Models for Learning Pairwise Relations in Data

    Author : Fazeleh Sadat Hoseini; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mulit-Armed Bandit; Pairwise Relations; Performance Modeling; Motion Trajectory Clustering; Minimax Distance; Bottleneck Identification; Online Learning; Representation Learning; Memory Efficiency; Concurrent Programming; Thompson Sampling;

    Abstract : Pairwise relations between data points are essential for numerous machine learning algorithms. Many representation learning methods consider pairwise relations to identify the latent features and patterns in the data. This thesis, investigates learning of pairwise relations from two different perspectives: offline learning and online learning. READ MORE

  6. 4. Approximation Algorithms for Geometric Networks

    Author : Mattias Andersson; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; control; systems; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap;

    Abstract : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. READ MORE

  7. 5. Inference of Effective Pairwise Relations for Data Processing

    Author : Fazeleh Sadat Hoseini; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Motion trajectory clustering; Concurrent programming; Representation Learning; Pairwise Relations; Memory Efficiency; Minimax Distance; Performance Modeling;

    Abstract : In various data science and artificial intelligence areas, representation learning is a performance-critical step. While different representation learning methods can detect different descriptive and latent features, many representation learning methods reflect on pairwise relations. READ MORE