Výsledky vyhledávání - "Mathematics of computing-Graph algorithms"

GraphCoder: Enhancing Repository-Level Code Completion via Coarse-to-fine Retrieval Based on Code Context Graph Autor Liu, Wei, Yu, Ailun, Zan, Daoguang, Shen, Bo, Zhang, Wei, Zhao, Haiyan, Jin, Zhi, Wang, Qianxiang

“…The performance of repository-level code completion depends upon the effective leverage of both general and repository-specific knowledge. Despite the…”
Získat plný text

Target set selection with maximum activation time Autor Keiler, Lucas, Lima, Carlos V.G.C., Maia, Ana Karolinna, Sampaio, Rudini, Sau, Ignasi

“…A target set selection model is a graph G with a threshold function τ : V → N upper-bounded by the vertex degree. For a given model, a set S0 ⊆ V (G) is a…”
Získat plný text

Romeo and Juliet Is EXPTIME-Complete Autor Gahlawat, Harmender, Křišťan, Jan Matyáš, Valla, Tomáš

Získat plný text

Molecular Graph Contrastive Learning with Parameterized Explainable Augmentations Autor Wang, Yingheng, Min, Yaosen, Shao, Erzhuo, Wu, Ji

“…Learning generalizable, transferable, and robust representations for molecule data has always been a challenge. The recent success of contrastive learning (CL)…”
Získat plný text