|
|
|
|
|
Fangling Leng, Fan Li, Yubin Bao, Tiancheng Zhang and Ge Yu
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sen Xue, Chengyu Wu, Jing Han and Ao Zhan
How to select the transmitting path in MPTCP scheduling is an important but open problem. This paper proposes an intelligent data scheduling algorithm using spatiotemporal synchronous graph attention neural networks to improve MPTCP scheduling. By exploi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marcos E. González Laffitte and Peter F. Stadler
The comparison of multiple (labeled) graphs with unrelated vertex sets is an important task in diverse areas of applications. Conceptually, it is often closely related to multiple sequence alignments since one aims to determine a correspondence, or more ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammed Suleiman Mohammed Rudwan and Jean Vincent Fonou-Dombeu
Ontology merging is an important task in ontology engineering to date. However, despite the efforts devoted to ontology merging, the incorporation of relevant features of ontologies such as axioms, individuals and annotations in the output ontologies rem...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wenjun Li, Xueying Yang, Chao Xu and Yongjie Yang
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xin Tian and Yuan Meng
Multi-relational graph neural networks (GNNs) have found widespread application in tasks involving enhancing knowledge representation and knowledge graph (KG) reasoning. However, existing multi-relational GNNs still face limitations in modeling the excha...
ver más
|
|
|
|
|
|
|
|
|
|
|
Songlin Tian, Ying Yang and Lei Yang
Business intelligence (BI), as a system for business data integration, processing, and analysis, is receiving increasing attention from enterprises. Data visualization is an important feature of BI, which allows users to visually observe the distribution...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jing Liu and Yong Zhong
As a structural indicator of dense subgraphs, k-core has been widely used in community search due to its concise and efficient calculation. Many community search algorithms have been expanded on the basis of k-core. However, relevant algorithms often set...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shaahin Angizi, Naima Ahmed Fahmi, Deniz Najafi, Wei Zhang and Deliang Fan
In this work, we present an efficient Processing in MRAM-Accelerated De Bruijn Graph-based DNA Assembly platform, named PANDA, based on an optimized and hardware-friendly genome assembly algorithm. PANDA is able to assemble large-scale DNA sequence datas...
ver más
|
|
|
|
|
|