Showing 1 - 16 results of 16 for search 'graph (matching OR machine) algorithm', query time: 0.06s Refine Results
  1. 1

    A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM by Al-Mohamad, HA

    Published 2020
    “…The complexity of the proposed algorithm is polynomial time, and it is O(n6 L) for matching graphs of size n. …”
    Get full text
    article
  2. 2
  3. 3
  4. 4

    Methodology for Analyzing the Traditional Algorithms Performance of User Reviews Using Machine Learning Techniques by Abdul Karim (417009)

    Published 2020
    “…In this research, different machine-learning algorithms such as logistic regression, random forest and naïve Bayes were tuned and tested. …”
  5. 5

    Machine Learning-Driven Prediction of Corrosion Inhibitor Efficiency: Emerging Algorithms, Challenges, and Future Outlooks by Najam Us Sahar Riyaz (22927843)

    Published 2025
    “…Drawing on more than fifteen harmonized datasets that span pyrimidines, ionic liquids, graphene oxides, and additional compound families, we benchmark traditional algorithms, such as artificial neural networks, support vector machines, k-nearest neighbors, random forests, against advanced graph-based and deep architectures including three-level directed message-passing neural networks, 2D3DMol-CIC, and graph convolutional networks. …”
  6. 6
  7. 7

    A linear programming approach for the weighted graph matchingproblem by Almohamad, H.A.

    Published 1993
    “…The complexity of the proposed algorithm is polynomial time, and it is O(n 6L) for matching graphs of size n. …”
    Get full text
    Get full text
    article
  8. 8

    A simulated evolution approach to task-matching and scheduling in heterogeneous computing environments by Barada, Hassan

    Published 2020
    “…Workloads are characterized according to the connectivity, heterogeneity, and communication-to-cost ratio of the task graphs representing the application tasks. The performance of SE is compared with a genetic algorithm approach for the same problem with respect to the quality of solutions generated, and timing requirements of the algorithms. r 2003 Elsevier Science Ltd. …”
    Get full text
    article
  9. 9
  10. 10
  11. 11
  12. 12

    Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

    Published 2024
    “…To achieve this goal, supervised machine learning was employed to train models on graphs with labeled data points, where each graph contains a set of points and a label indicating the centroid determined by K-means. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  13. 13
  14. 14
  15. 15

    Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS by Tekli, Joe

    Published 2018
    “…., considering the lexical and semantic similarities/disparities when matching user query and data index terms. To do so, we design and construct a semantic-aware inverted index structure called SemIndex, extending the standard inverted index by constructing a tightly coupled inverted index graph that combines two main resources: a semantic network and a standard inverted index on a collection of textual data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  16. 16