A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

The Progressive Edge-Growth (PEG) algorithm for generating Tanner graphs (parity check matrices) for LDPC codes. Its main goal is to avoid short cycles in the graph, which improves performance under ...

Abstract: With the wide application of graph neural network (GNN) in many fields, how to extract and aggregate node features effectively has become a hot research issue. In this paper, we propose a ...

It hadn’t occurred to me in quite these terms before, but Google has an algorithm for its Knowledge Graph. I have been tracking the Knowledge Graph API for five years. The resultScores have always ...

Abstract: In order to solve the problem of sparse text modality semantics and difficulty in fully mining features in current cross-modal retrieval algorithms, a cross-modal retrieval algorithm (GCMR) ...