Graph Computing Systems and Partitioning Techniques: A Survey حسب Tewodros Alemu Ayall (19273717)

الموضوعات:

Information reconciliation through agent controlled graph model. (c2018) حسب Saba, Rita

"…Our approach provides a damage assessment and recovery algorithm that is based on agents and graphs.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

"…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. …"

Detecting protein complexes in protein interaction networks using Mapper and Graph Convolution Networks حسب Daou, Leonardo

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Cyber-Physical System and Graph-Based Approach for Transportation Management in Smart Cities حسب Muhammad Mazhar Rathore (17051745)

"…The system makes use of travel-time, traffic intensity, vehicle’s speed, and current road conditions to construct a weighted city graph representing the road network. Traditional graph algorithms with efficient implementation technologies are employed to respond to commuters’ and authorities’ needs in order to achieve a smart and optimum transportation system. …"

Correlation Clustering with Overlaps حسب Fakhereldine, Amin

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Correlation Clustering via s-Club Cluster Edge Deletion حسب Makarem, Norma

"…In certain situations, the requirement for clusters to be cliques was deemed excessively stringent, leading to the proposal of alternative relaxed clique models for dense subgraphs, such as s-club. In this work, we implement three approaches to tackle the 2-club clustering via edge deletion: a heuristic approach based on the influence of the edge to resolve maximum conflicts, a parameterized algorithm in which by deleting a maximum of k edges, the graph can be transformed into a 2-club cluster based on a branching algorithm, and the approach in Integer Linear Programming to find the optimized solution in an integer formulation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Sensitivity to parameters and general applicability of genetic algorithms and simulated annealing algorithms for mapping data to multicomputers. (c1994) حسب Kawash, Jalal Y.

احصل على النص الكامل
احصل على النص الكامل

An Effective Hash Based Assessment and Recovery Algorithm for Healthcare Systems حسب Boukhari, Bahia

"…Finally, the experimental results prove the improvements provided by our hash based algorithm over previously suggested models.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm حسب Nasser, Youssef

"…Hundreds of such labeled graphs were used to train the model to predict the location of centroids. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A method for the minimum coloring problem using genetic algorithms حسب Harmanani, Haidar

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Physical optimization algorithms for mapping data to distributed-memory multiprocessors حسب Mansour, Nashat

"…The technique proposed for large problems is based on a pre-mapping graph contraction heuristic algorithm, which results in a smaller search space. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem حسب Harmanani, Haidar M.

"…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …"
احصل على النص الكامل
احصل على النص الكامل

Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks حسب Abu-Khzam, Faisal N.

"…These networks have non-uniform transmission ranges and are modeled using directed disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† حسب Harmanani, Haidar

"…This paper presents a hardware implementation to solve the graph colouring problem (chromatic number χ(G)) for arbitrary graphs using the Hopfield neural network (HNN) model of computation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A data envelopment analysis model for opinion leaders’ identification in social networks حسب Hamed Baziyad (19273738)

Optimum Partition of Power Networks Using Singular Value Decomposition and Affinity Propagation حسب Maymouna Ez Eddin (21633650)

"…From this perspective, this paper proposes an efficient framework for fast and optimal PGP, based on singular value decomposition analysis of the graph's Laplacian. An Affinity Propagation clustering algorithm-based PGP is tailored for automatically forming highly interconnected clusters based on pairwise similarities without requiring a predefined number of partitions. …"

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

"…We then provide a general keyword query model with specially tailored query processing algorithms built on top of SemIndex, in order to produce semantic-aware results, allowing the user to choose the results' semantic coverage and expressiveness based on her needs. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Correlation Clustering via 2-Club Clustering with Vertex Splitting حسب Thoumi, Sergio

"…In this problem, we apply a sequence of k edge (or vertex) additions and/or deletions so the graph becomes a topological sum of clusters. At first, a cluster was considered a clique but relaxation models have later emerged as cliques were deemed too strict of a requirement in application domains. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Degree-Based Network Anonymization حسب Halawi, Ola

"…In this thesis, we study a new multi- objective parameterized anonymization approach that generalizes the known degree anonymization problem and attempts at improving it as a more realistic model for data security/privacy. Our model suggests a convenient privacy level for each net- work based on the standard deviation of its degrees. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل