Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 5925 for “"kernel"”.
-
Kernel
Kernel is a fifteen-minute work for wind ensemble. Its unifying strands of rhythm, melody, and harmony are spun out of simple four-note tone clusters which undergo changes in contour, intervallic inversion, register, texture, and harmonic environment. These four notes make up the "kernel" of the …
-
Dimensionality reduction by kernel CCA in reproducing kernel hilbert spaces
… thesis, we employ a multi-modal method (i.e., kernel canonical correlation analysis) named RKCCA to implement dimensionality reduction for high dimensional data. Our RKCCA method first maps the original data into the Reproducing Kernel Hilbert Space (RKHS) by explicit kernel functions, whereas …
-
Usermode kernel : running the kernel in userspace in VM environments
… This gives processes more power and access to kernel memory bypassing the need to copy data from user to kernel and vice versa as is required when the traditional ring protection layer is enforced. This allows us to save the system call trap overhead and allows application program mers to …
-
Deep Embedding Kernel
Kernel methods and deep learning are two major branches of machine learning that have achieved numerous successes in both analytics and artificial intelligence. While having their own unique characteristics, both branches work through mapping data to a feature space that is supposedly more …
-
Oxidizing the Kernel
… the viability of using Rust in the Linux kernel. To accomplish this, we have rewritten a read-only version of the exFAT file system driver in Rust and evaluated it in terms of security and performance. The security evaluation was split into two parts. For the first part, we have tried to …
-
The Marcel Riesz Kernel and a Green Kernel for a Half-Space
… is to study some aspects of the Marcel Riesz kernel and the notion of superharmonicity of fractional order. We define a Green kernel for a half-space and show that this kernel satisfies the principle of domination. This lead us to a new definition of superharmonicity of fractional order on a …
-
Small-kernel image restoration
… implemented by convolving an image with a small kernel. Small-kernel convolution is a local operation that requires relatively little processing and can be easily implemented in parallel. A small-kernel technique must compromise effectiveness for efficiency, but if the kernel values are …
-
Kernel-based Copula Processes
… time-series analysis. I coined this new model Kernel-based Copula Processes (KCPs). Under the new proposed framework, various idiosyncracies can be modeled compactly via a kernel function for each individual time-series, and long-range dependency can be captured by a copula function. The copula …
-
Generating Kernel Aware Polygons
… for generating polygons admitting large size kernels. We also present experimental results on generating such polygons.
-
Sparse Kernel feature extraction
… The analysis results in a new derivation for Kernel Feature Analysis (KFA) and the formation of two novel matrix approximation methods based on PLS. In the supervised case, we apply the general feature extraction framework to derive two new methods based on maximising covariance and alignment …
-
Adaptive kernel density estimation
The need for improvements over the fixed kernel density estimator in certain situations has been discussed extensively in the literature, particularly in the application of density estimation to mode hunting. Problem densities often exhibit skewness or multimodality with differences in scale for …
-
Probabilistic multiple kernel learning
The integration of multiple and possibly heterogeneous information sources for an overall decision-making process has been an open and unresolved research direction in computing science since its very beginning. This thesis attempts to address parts of that direction by proposing probabilistic data …
-
Kernel deconvolution density estimation
<p>This dissertation is about kernel deconvolution density estimation (KDDE), which is nonparametric density estimation based on a sample contaminated with measurement error. It is separated in four parts. First we explore some methodological aspects of KDDE. In the following two parts we describe …
-
High Performance Inter-kernel Communication and Networking in a Replicated-kernel Operating System
… operating system architectures is the Multi-kernel. Multi-kernels not only address scalability issues, but also inherently support heterogeneity. Furthermore, provide an easy way to properly map computing workloads to the correct type of processing resources in presence of heterogeneity. …
-
Kernel Machines are Not Black Boxes - On the Interpretability of Kernel-based Nonparametric Models
Kernel-based nonparametric models are often perceived as uninterpretable black boxes. This notion is however questionable; permutation-based variable importance, for example, is one approach for interpreting various nonparametric models. Unfortunately, besides being computationally intensive, …
-
Comparison between an algorithm for kernel estimation and an algorithm for variable kernel estimation
… estimators. The first algorithm, based on kernel density estimators, gives a method for approximating the optimal parameter The second algorithm studied works with variable kernel estimators finding for this estimator optimal parameters. Very good results were obtained with the samples …
-
Hydrodynamic Memory Kernel Extraction of a Microfluidic Particle with Machine Learning Based Kernel Estimation
… by a convolution integral involving a memory kernel tensor extracted from direct numerical simulations (DNS). However, both DNS and the subsequent kernel optimization are computationally expensive, and the optimization can suffer from numerical artifacts that compromise physical realizability. …
-
Kernel engineering on parse trees
… explore the structure features. Alternatively, kernel methods can explore a very high dimensional feature space for these complex input structures without explicitly representing the input data as a feature vector. In terms of tree structures, tree kernels can explore the subtree features in the …
Page 1 of 297