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 3 of 3 for “"Hamming metric"”.

  1. Hash code learning for large scale similarity search

    … bit allocation strategy seamlessly converts the Hamming distance between hash codes into a likelihood ratio test statistic, which is the optimal decision rule to decide if samples are related. We show via experiments that at the same false positive rate, the proposed method could obtain false …

    uiuc Repository record for Hash code learning for large scale similarity search (opens in a new tab)

  2. Consensus Algorithms for Trees and Strings

    … distances between strings are measured using the Hamming metric. We present new inapproximability results and various types of approximation algorithms as well as exact polynomial-time algorithms for certain restrictions of the problems.

    lund Repository record for Consensus Algorithms for Trees and Strings (opens in a new tab)

  3. Efficient Image and Video Representations for Retrieval

    … Binary Code'. We also propose a new class­ based Hamming metric that dramatically reduces the retrieval times for larger databases, where only hamming distance is computed to the class binary codes. We also propose a Deep semantic binary code model, by replacing the output layer of a popular …

    maryland Repository record for Efficient Image and Video Representations for Retrieval (opens in a new tab)