Showing 1 - 14 results of 14 for search '(((( complement both algorithms ) OR ( elements jaya algorithm ))) OR ( neural coding algorithm ))', query time: 0.14s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    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
  10. 10
  11. 11

    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
  12. 12
  13. 13

    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. …”
  14. 14

    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). …”