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 4 of 4 for “"Perfect-hash"”.

  1. Perfect hashing and related problems

    … structure that supports these operations is a hash table. On a hash table, a basic operation takes 𝑂(1) time in the average case and 𝑂(𝑛) time in the worst case, where n is the number of words in the dictionary. While an ordinary hash function maps the words in a dictionary to a hash table with …

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

  2. Efficient data structures for information retrieval

    … the application of efficient data structures and hashing algorithms to the problems of textual information storage and retrieval. We have developed static and dynamic techniques for handling large dictionaries, inverted lists, and optimizations applied to ranking algorithms. We have carried out an …

    vt Repository record for Efficient data structures for information retrieval (opens in a new tab)

  3. Softwarový model firewallu

    … klasifikátor využívá pro klasifikaci algoritmus Perfect-Hash. Klasifikátor je implementován v několika verzích. Jako implementační jazyk je použitý jazyk C, pro samotný klasifikátor a jazyk Python, pro vytvoření pomocných datových struktur. Jazyk C byl zvolen kvůly jeho rychlosti.

    brno-tech Repository record for Softwarový model firewallu (opens in a new tab)

  4. Invariant embeddings of the Deligne-Lusztig curves with applications

    … with applications in algebraic geometry codes, hash families, and polar codes. This thesis consists of four parts, the first part presents our result in finding smooth embeddings for the Deligne-Lusztig curves in projective space. The second part concerns certain Riemann-Roch spaces and AG-codes …

    uiuc Repository record for Invariant embeddings of the Deligne-Lusztig curves with applications (opens in a new tab)