Essays about: "approximation algorithms"

Showing result 1 - 5 of 81 essays containing the words approximation algorithms.

  1. 1. Feature Selection for Microarray Data via Stochastic Approximation

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : Erik Rosvall; [2024-03-18]
    Keywords : feature selection; feature ranking; microarray data; stochastic approximation; Barzilai and Borwein method; Machine Learning; AI;

    Abstract : This thesis explores the challenge of feature selection (FS) in machine learning, which involves reducing the dimensionality of data. The selection of a relevant subset of features from a larger pool has demonstrated its effectiveness in enhancing the performance of various machine learning algorithms. READ MORE

  3. 2. Approximating material area, volume,and velocity for belt conveyor systemapplications using 3D depth sensor technology

    University essay from Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Author : Viktor Centing; [2023]
    Keywords : ToF depth sensor; LiDAR sensor; LMS4000; Visionary T mini; BCS; ToF applications; velocity approximation;

    Abstract : Time of Flight (ToF) technology describes products or systems which measure distance by calculating the distance emitted light travels before bouncing off its surroundings and ending back up at the system. Since the early 2000s, many advancements in the area of ToF systems have been made leading to much use for the ToF variant LiDAR. READ MORE

  4. 3. Randomized Diagonal Estimation

    University essay from KTH/Matematik (Avd.)

    Author : Niclas Joshua Popp; [2023]
    Keywords : Diagonal estimation; randomized numerical linear algebra; low-rank approximation; matrix functions; Diagonalestimering; randomiserad numerisk linjär algebra; lågrankad approximation; matrisfunktioner;

    Abstract : Implicit diagonal estimation is a long-standing problem that is concerned with approximating the diagonal of a matrix that can only be accessed through matrix-vector products. It is of interest in various fields of application, such as network science, material science and machine learning. READ MORE

  5. 4. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection

    University essay from Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)

    Author : Ioannis Broumas; [2023]
    Keywords : MIMO; massive MIMO; GPU; CUDA; Software Defined Radio; SDR; MMSE; ZF; zero-forcing; parallel detection; iterative methods; conjugate residual; parallel computing; kernel fusion;

    Abstract : This thesis presents a comparison of a GPU implementation of the Conjugate Residual method as a sequence of generic library kernels against implementations ofthe method with custom kernels to expose the performance gains of a keyoptimization strategy, kernel fusion, for memory-bound operations which is to makeefficient reuse of the processed data. For massive MIMO the iterative solver is to be employed at the linear detection stageto overcome the computational bottleneck of the matrix inversion required in theequalization process, which is 𝒪(𝑛3) for direct solvers. READ MORE

  6. 5. A geometric approach to calculating the limit set of eigenvalues for banded Toeplitz matrices

    University essay from Lunds universitet/Matematik LTH

    Author : Teodor Bucht; [2023]
    Keywords : Toeplitz matrices; Banded Toeplitz matrices; Limit set; Eigenvalues; Mathematics and Statistics;

    Abstract : This thesis is about the limiting eigenvalue distribution of n × n Toeplitz matrices as n → ∞. The two classical questions we want to answer are: what is the limit set of the eigenvalues, and what is the limiting distribution of the eigenvalues. Our main result is a new approach to calculate the limit set Λ(b) for a Laurent polynomial b, i.e. READ MORE