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 2043 for “"KERNELS"”.

  1. Analytic Group Kernels and Lie Algebra Kernels

    Made available in DSpace on 2014-12-05T21:50:04Z (GMT). No. of bitstreams: 1 0013519.pdf: 4191483 bytes, checksum: 8be73568683b59703b526632ade49bfc (MD5) Previous issue date: 1955

    uiuc Repository record for Analytic Group Kernels and Lie Algebra Kernels (opens in a new tab)

  2. Graph Kernels

    … in expressivity, or hard to parameterize. Graph kernels have recently been proposed as a theoretically sound and promising approach to the problem of graph comparison. Their attractivity stems from the fact that by defining a kernel on graphs, a whole family of data mining and machine learning …

    lmu-germany Repository record for Graph Kernels (opens in a new tab)

  3. Noncommutative Kernels

    Positive kernels and their associated reproducing kernel Hilbert spaces have played a key role in the development of complex analysis and Hilbert-space operator theory, and they have recently been extended to the setting of free noncommutative function theory. In this paper, we develop the subject …

    vt Repository record for Noncommutative Kernels (opens in a new tab)

  4. Woven String Kernels

    Woven string kernels are a form of evolvable, directed, acyclic graphs specialized to perform DNA classification. They are introduced in this thesis, given a rigorous theoretical treatment as a mathematical object, and shown to have a number of interesting properties. Two forms of woven string …

    guelph Repository record for Woven String Kernels (opens in a new tab)

  5. Kernels: Regularization and Optimization

    … extends the paradigm of machine learning with kernels. This paradigm is based on the idea of generalizing an inner product between vectors to a similarity measure between objects. The kernel implicitly defines a feature mapping between the space of objects and the space of functions, called the …

    anu Repository record for Kernels: Regularization and Optimization (opens in a new tab)

  6. Information Theoretic Graph Kernels

    … on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic kernels, for (un)attributed graphs. We show that our kernels overcome the shortcomings of …

    whiterose Download PDF for Information Theoretic Graph Kernels (opens in a new tab)

  7. Hash kernels and structured learning

    … for machine learning algorithms. We propose hash kernels to facilitate efficient kernels which can deal with massive multi-class problems. We show a principled way to compute the kernel matrix for data streams and sparse feature spaces. We further generalise it via sampling to graphs. Later we …

    anu Repository record for Hash kernels and structured learning (opens in a new tab)

  8. Interpretable modelling with sparse kernels

    A drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is difficult to interpret. The principal focus of this thesis is the development of advanced non-linear interpretable models. Interpretable modelling offers us a powerful tool with …

    soton Download PDF for Interpretable modelling with sparse kernels (opens in a new tab)

  9. Windows and Generalized Drinfeld Kernels

    … and Favero. We use this construction to provide kernels for Grassmann flops over an arbitrary field of characteristic zero. In the case of Grassmann flops this generalization recovers the kernel for a Fourier-Mukai functor on the derived category of the associated global quotient stack studied by …

    south-carolina Repository record for Windows and Generalized Drinfeld Kernels (opens in a new tab)

  10. Testing Monotonicity of Pricing Kernels

    … to test mononicity of empirical pricing kernels (EPK) is presented. By testing monotonicity of pricing kernel we can determine whether utility function is concave or not. Strictly decreasing pricing kernel corresponds to concave utility function while non-decreasing EPK means that utility …

    humboldt-diss Repository record for Testing Monotonicity of Pricing Kernels (opens in a new tab)

  11. Volterra Systems with Realizable Kernels

    … constructing state representation for realizable kernels can be challenging at times; therefore, we propose a rational approximation approach to avoid the problem. That is, we approximate the transfer function by a rational function, construct the corresponding linear system, and then approximate …

    vt Repository record for Volterra Systems with Realizable Kernels (opens in a new tab)

  12. Parametric kernels for structured data analysis

    … produced distance metrics, called “parametric kernels”, are positive semi-definite and require almost linear time to compute. To demonstrate the general applicability and the efficacy of this approach, I designed and applied parametric kernels to handwritten character recognition, on-line face …

    texas Repository record for Parametric kernels for structured data analysis (opens in a new tab)

  13. Customizing kernels in Support Vector Machines

    … analysis. One important part of SVMs are the kernels. Although there are several widely used kernel functions, a carefully designed kernel will help to improve the accuracy of SVMs. We present two methods in terms of customizing kernels: one is combining existed kernels as new kernels, the …

    waterloo Repository record for Customizing kernels in Support Vector Machines (opens in a new tab)

  14. Automated Generation of Domain Specific Kernels

    … specific libraries comprised of hand-optimized kernels that are meticulously tuned to take advantage of the target hardware and avoid any bottlenecks. This thesis argues that we can automatically generate and optimize programs by building domain specific tools that search for efficient code. I …

    washington Repository record for Automated Generation of Domain Specific Kernels (opens in a new tab)

  15. Studies on Kernels of Simple Polygons

    The kernel of a simple polygon is the set of points in its interior from which all points inside the polygon are visible. We formally establish that for a given convex polygon Q we can always construct a larger simple polygon with many reflex vertices such that Q is the kernel of P. We present …

    unlv Repository record for Studies on Kernels of Simple Polygons (opens in a new tab) Download PDF for Studies on Kernels of Simple Polygons (opens in a new tab)

  16. Kernels for d and (dee-bar)

    This thesis studies kernels related to the d and a equations in Euclidean space. A formalism is developed for representing kernels on differential forms in an open set as currents on the product x n and the use of this formalism in studying d and a is investigated. Specific examples of kernels are …

    rice Repository record for Kernels for d and (dee-bar) (opens in a new tab)

Page 1 of 103