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 410 for “"Hashing"”.

  1. Improving Cuckoo Hashing with Perfect Hashing

    … that it can be used efficiently. There are many hashing techniques that aim at storing keys in memory to increase key access efficiency and to make hashing efficient. One option to increase throughput is to use the algorithms based on hashing. Cuckoo Hashing is one among the techniques which …

    umkc Repository record for Improving Cuckoo Hashing with Perfect Hashing (opens in a new tab)

  2. Perfect hashing and related problems

    … a hash table with no collisions. Thus, perfect hashing is a special case of hashing, in which a find operation takes 𝑂(1) time in the worst case, and an insert or a delete operation takes 𝑂(1) time in the average case and 𝑂(𝑛) time in the worst case. This thesis addresses the following issues: …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  3. Image compression using locally sensitive hashing

    … of the main tools we use is Locally Sensitive Hashing (LSH), a relatively new technique mainly used for similarity search in high-dimensions.

    texas Repository record for Image compression using locally sensitive hashing (opens in a new tab)

  4. Deep Hashing for Image Similarity Search

    Hashing for similarity search is one of the most widely used methods to solve the approximate nearest neighbor search problem. In this method, one first maps data items from a real valued high-dimensional space to a suitable low dimensional binary code space and then performs the approximate …

    ucf Repository record for Deep Hashing for Image Similarity Search (opens in a new tab)

  5. Probabilistic Hashing Techniques For Big Data

    We investigate probabilistic hashing techniques for addressing computational and memory challenges in large scale machine learning and data mining systems. In this thesis, we show that the traditional idea of hashing goes far beyond near-neighbor search and there are some striking new …

    cornell Repository record for Probabilistic Hashing Techniques For Big Data (opens in a new tab)

  6. Online hashing for fast similarity search

    In this thesis, the problem of online adaptive hashing for fast similarity search is studied. Similarity search is a central problem in many computer vision applications. The ever-growing size of available data collections and the increasing usage of high-dimensional representations in describing …

    bu Repository record for Online hashing for fast similarity search (opens in a new tab)

  7. Perceptually based methods for robust image hashing

    … of conventional cryptographic (and other) hashing algorithms such as message digest 5 (MD5) and secure hash algorithm 1 (SHA-1) is that they are extremely sensitive to the message; i.e., changing even one bit of the input message will change the output dramatically. However, multimedia data …

    texas Repository record for Perceptually based methods for robust image hashing (opens in a new tab)

  8. Fast Hashing in Elliptic and Hyperelliptic Curves

    The BLS Digital Signature Algorithm is a cryptographic scheme using elliptic curves over finite fields. In the BLS Digital Signature Algorithm, we require a function that maps a arbitrary element of a finite field to an elliptic curve in that field. There is a simple, naive way to do this, but it …

    maryland Repository record for Fast Hashing in Elliptic and Hyperelliptic Curves (opens in a new tab)

  9. Similarity hashing of malware on IoT devices

    A security threat to enterprise networks is the malware that exists on IoT devices which is rarely controlled at the same level that are observed for conventional computing devices. More specifically, IoT devices are poorly monitored for malware. Through self-modification, this malware attempts to …

    colo-mines Repository record for Similarity hashing of malware on IoT devices (opens in a new tab)

  10. Identificando plágio externo com Locality-sensitive hashing

    … proposed for handling high-dimensional spaces, hashing them to a lower number of hash values. Our two Minmax Circular Sector Arcs methods, Minmax Circular Sector Arcs Lower Bound and Minmax Circular Sector Arcs Full Bound, achieved Recall levels slightly more imprecise than Minmaxwise hashing in …

    brazil-uerj Repository record for Identificando plágio externo com Locality-sensitive hashing (opens in a new tab)

  11. Direct perfect hashing functions for external files

    Thesis (M.S.)--Michigan State University. Department of Computer Science, 1988

    msu Repository record for Direct perfect hashing functions for external files (opens in a new tab)

  12. Robust digital image hashing algorithms for image identification

    Image hashing has been a popular alternative of digital watermarking for copyright protection and content authentication of digital images, due to its two critical properties -- robustness and security. Also, its uniqueness and compactness make image hashing attractive for efficient image indexing …

    ubc Repository record for Robust digital image hashing algorithms for image identification (opens in a new tab) Download PDF for Robust digital image hashing algorithms for image identification (opens in a new tab)

  13. Photometric stereo via locality sensitive high-dimension hashing

    … we apply locality sensitive high dimensional hashing (LSH) to compute the irregular target object's surface orientation. The experimental results of a simplified photometric stereo experiment show consistent results in surface orientation LSH can be implemented very efficiently; and it offers …

    ubc Repository record for Photometric stereo via locality sensitive high-dimension hashing (opens in a new tab) Download PDF for Photometric stereo via locality sensitive high-dimension hashing (opens in a new tab)

  14. On Hashing-Based Approaches to Approximate DNF-Counting

    … scheme (FPRAS). For CNF constraints, hashing-based techniques are highly successful. It was recently shown that hashing techniques also yield an FPRAS for DNF counting. Our analysis, however, shows that the proposed hashing approach provides poor time complexity compared to the Monte …

    rice Repository record for On Hashing-Based Approaches to Approximate DNF-Counting (opens in a new tab)

  15. Mining Massive-Scale Time Series Data using Hashing

    … this issue, we design SSH (Sketch, Shingle, & Hashing), an efficient and approximate hashing scheme which is much faster than the state-of-the-art branch and bound searching technique: the UCR suite. SSH uses a novel combination of sketching, shingling and hashing techniques to produce …

    rice Repository record for Mining Massive-Scale Time Series Data using Hashing (opens in a new tab)

  16. Scalable and Sustainable Deep Learning via Randomized Hashing

    … and energy standpoint. We present a novel hashing-based technique to drastically reduce the amount of computation needed to train and test neural networks. Our approach combines two recent ideas, Adaptive Dropout and Randomized Hashing for Maximum Inner Product Search (MIPS), to select the …

    rice Repository record for Scalable and Sustainable Deep Learning via Randomized Hashing (opens in a new tab)

  17. A geometric hashing technique for star pattern recognition

    … attitude sensors. Specifically, a geometric hashing approach is proposed that describes star patterns by the four interior star angles that form the perimeter of a star quad. A technique is presented for labeling these four interior star angles to make the hash code both unique as well as …

    wvu Repository record for A geometric hashing technique for star pattern recognition (opens in a new tab)

Page 1 of 21