Sökning: "approximation algorithms"
Visar resultat 1 - 5 av 83 uppsatser innehållade orden approximation algorithms.
1. Feature Selection for Microarray Data via Stochastic Approximation
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : 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. LÄS MER
2. Approximating material area, volume,and velocity for belt conveyor systemapplications using 3D depth sensor technology
Uppsats för yrkesexamina på avancerad nivå, Luleå tekniska universitet/Institutionen för system- och rymdteknikSammanfattning : 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. LÄS MER
3. Randomized Diagonal Estimation
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : 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. LÄS MER
4. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection
Master-uppsats, Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)Sammanfattning : 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. LÄS MER
5. A geometric approach to calculating the limit set of eigenvalues for banded Toeplitz matrices
Master-uppsats, Lunds universitet/Matematik LTHSammanfattning : 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. LÄS MER