Showing 1 - 20 results of 21 for search '(((( element per algorithm ) OR ( complement finding algorithm ))) OR ( neural coding algorithm ))', query time: 0.10s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  10. 10
  11. 11
  12. 12

    On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

    Published 2017
    “…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  13. 13

    A new approach and faster exact methods for the maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  14. 14

    A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand by Khawar Naeem (17984062)

    Published 2023
    “…Although the scenario analysis is supported by simulation models, they further require the optimization models to yield optimal key parameter values. One noticeable finding is that only 12% of the articles used quantitative models to complement SDM for the decision-making process. …”
  15. 15
  16. 16
  17. 17

    The maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 18

    Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

    Published 2019
    “…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19

    Oversampling techniques for imbalanced data in regression by Samir Brahim Belhaouari (9427347)

    Published 2024
    “…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …”
  20. 20

    Developing an online hate classifier for multiple social media platforms by Joni Salminen (7434770)

    Published 2020
    “…We then experiment with several classification algorithms (Logistic Regression, Naïve Bayes, Support Vector Machines, XGBoost, and Neural Networks) and feature representations (Bag-of-Words, TF-IDF, Word2Vec, BERT, and their combination). …”