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 5 of 5 for “"Ukkonen"”.

  1. Java exception matching in real time using fuzzy logic

    … "Bitap", "Boyer-Moore" and in some degree "Ukkonen". In the end, a modified version of the original Levenshtein algorithm - utilizing lazy evaluation and thresholding - was determined the best suited comparison algorithm for this problem. Sammanfattning Den här examenstesen berör problemet …

    chalmers Repository record for Java exception matching in real time using fuzzy logic (opens in a new tab)

  2. Algorithms for finding orders and analyzing sets of chains

    Rankings of items are a useful concept in a variety of applications, such as clickstream analysis, some voting methods, bioinformatics, and other fields of science such as paleontology. This thesis addresses two problems related to such data. The first problem is about finding orders, while the …

    aalto Repository record for Algorithms for finding orders and analyzing sets of chains (opens in a new tab)

  3. Contrast sensitivity for complex and random gratings

    This thesis studied the effect of (i) the number of grating components and (ii) parameter randomisation on root-mean-square (r.m.s.) contrast sensitivity and spatial integration. The effectiveness of spatial integration without external spatial noise depended on the number of equally spaced …

    aston Download PDF for Contrast sensitivity for complex and random gratings (opens in a new tab)

  4. Konstrukce sufixových stromů a jejich využití v bioinformatice

    … metody pro tvorbu sufixového stromu navrženou E. Ukkonenem a přibližným vyhledáváním podřetězců. To je realizováno za pomoci dynamického programování, upraveného pro využití sufixových stromů. Obě tyto metody jsou popsány pseudokódem a implementovány v příloze práce.

    brno-tech Repository record for Konstrukce sufixových stromů a jejich využití v bioinformatice (opens in a new tab)

  5. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

    This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm uses 64.3% less memory and in our experiments runs asymptotically 20% …

    uvic Repository record for Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security. (opens in a new tab)