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 “"Counting complexity"”.

  1. Counting complexity: compressed Ηamming distance, vertex covers and recent highlights

    Σε αυτήν την εργασία αντιμετωπίζουμε το πρόβλημα της συμπιεσμένης απόστασης Hamming. Η απόσταση Hamming είναι ένα εύκολο πρόβλημα, ωστόσο όταν τα δεδομένα εισόδου είναι τεράστιου μεγέθους, χρειαζόαμστε μια συμπίεσή τους για να μπορέσουμε να δημιουργήσουμε αποδωτικούς αλγορίθμους. Σ' αυτήν την …

    athens Repository record for Counting complexity: compressed Ηamming distance, vertex covers and recent highlights (opens in a new tab)

  2. Probabilistic techniques for analyzing sampling algorithms and the dynamics of lattice models

    … throughout machine learning, optimization, and counting complexity. In this dissertation, we present several new techniques based on random walks for analyzing sampling algorithms and the dynamics of various lattice models from statistical physics. We start by investigating the mixing time of …

    gatech Repository record for Probabilistic techniques for analyzing sampling algorithms and the dynamics of lattice models (opens in a new tab)

  3. On parameterized counting

    … analyze the intrinsic hardness of parameterized counting problems. We have analyzed the parameterized complexity of #W(P)-complete problems. We proved that, (under some complexity theoretic hypothesis): <br>1. Any #W(P)-complete is harder than any problem in the A hierarchy. <br>2. Any …

    freiburg-diss Repository record for On parameterized counting (opens in a new tab)

  4. On Tractability and Consistency of Probabilistic Inference in Relational Domains

    … the intractability of Weighted First Order Model Counting (WFOMC), as both learning and inference in SRL models can be reduced to instances of WFOMC. Hence, fragments of first-order logic that admit tractable WFOMC, widely known as domain-liftable, can significantly advance the practicality and …

    trento Repository record for On Tractability and Consistency of Probabilistic Inference in Relational Domains (opens in a new tab)