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 2 of 2 for “"Nachbarschaftsgraph"”.

  1. Parameterfreies hierarchisches Graph-Clustering-Verfahren zur Interpretation raumbezogener Daten

    … einen Seite in der Anwendung der Hierarchie von Nachbarschaftsgraphen zur Definition der Nachbarschaft eines Einzelobjekts oder eines Objektclusters in allgemeiner Art und Weise, sowie auf der anderen Seite in der Definition eines Entscheidungskriteriums zur Ähnlichkeitsbestimmung von Clustern, …

    stuttgart Repository record for Parameterfreies hierarchisches Graph-Clustering-Verfahren zur Interpretation raumbezogener Daten (opens in a new tab)

  2. Automorphism groups of self-dual codes

    This thesis treats linear block codes, which are classically used in the storage and transmission of digital information. The dual of such a code is the orthogonal space with respect to a Euclidian or Hermitian scalar product. A code which equals its dual is called self-dual. Self-dual codes are of …

    aachen Repository record for Automorphism groups of self-dual codes (opens in a new tab)