Computer Sciences
The k-prize-collecting minimum vertex cover problem with submodular penalties (k-PCVCS) is a generalization of the minimum vertex cover problem, which is one of the most important and fundamental problems in graph theory ...
Aug 23, 2023
0
3
Computer Sciences
The latest advance in recommendation technology shows that better user and item representations can be learned via performing graph convolutions on the user-item interaction graph. However, such a finding is mostly restricted ...
Apr 22, 2022
0
7
Threat detection and prevention are essential to ensuring the safety and security of warfighters. Researchers have developed a way to speed up the processing of extremely large graphs and data, making the most efficient use ...
May 5, 2020
0
6
