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 7 of 7 for “"Partial Distance"”.

  1. Applications of stochastic control and statistical inference in macroeconomics and high-dimensional data

    … topic involves the fast computing algorithm of partial distance covariance statistics with its application in feature screening in high dimensional data. We show that an O(n log n) algorithm for a version of the partial distance covariance exists, compared with the O(n^2) algorithm implemented …

    gatech Repository record for Applications of stochastic control and statistical inference in macroeconomics and high-dimensional data (opens in a new tab)

  2. Answering Shortest Path Distance Queries in Large Complex Networks

    The \emph{distance query} problem is to find the shortest-path distance between an arbitrary pair of vertices in a graph. It is considered as a fundamental problem in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solution that can scale to …

    anu Repository record for Answering Shortest Path Distance Queries in Large Complex Networks (opens in a new tab)

  3. State machine interpretation of arithmetic codes for joint source and channel coding

    … with forbidden symbols. It allows us to find the partial distance spectrum of arithmetic codes with forbidden symbols. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes. The low implementation precision results in a state machine …

    nebraska Repository record for State machine interpretation of arithmetic codes for joint source and channel coding (opens in a new tab)

  4. New Algorithms andMethodology for Analysing Distances

    Distances arise in a wide variety of di�erent contexts, one of which is partitional clustering, that is, the problem of �nding groups of similar objects within a set of objects.¿ese groups are seemingly very easy to �nd for humans, but very di�cult to �nd for machines as there are two major …

    east-anglia Download PDF for New Algorithms andMethodology for Analysing Distances (opens in a new tab)

  5. Association measures and prior information in the reconstruction of gene networks

    … process is a natural and promising way to partially compensate for the lack of reliable expression data and to increase the accuracy of network reconstruction algorithms. In this thesis, we present PriorPC, a new algorithm based on the PC algorithm that uses prior knowledge. Despite being …

    fu-berlin Repository record for Association measures and prior information in the reconstruction of gene networks (opens in a new tab)

  6. Structured eigenvectors, interlacing, and matrix completions

    … for matrices with data from the complex numbers, distance matrix cycle completability conditions, the P-matrix completion problem, and the totally non-negative completion problem. We show that the positive semidefinite cycle completion problem for matrices with complex data is a special case of a …

    wm-mary Repository record for Structured eigenvectors, interlacing, and matrix completions (opens in a new tab)

  7. An Analysis of the Properties of Polar Codes

    Polar Codes have risen to the forefront of practical coding theory, due to their incredible efficiency and ease of construction. Originally introduced by Arikan in his 2009 paper, they are the first code defined with an explicit construction that achieved channel capacity. Moreover, polar codes …

    clemson Repository record for An Analysis of the Properties of Polar Codes (opens in a new tab)