3 papers
cs.SE2026
OpenHarmony Bench: Evaluating LLMs and Coding Agents on OpenHarmony App Development
Li Li, Han Hu, Tianjian Zhang +27
We present OPENHARMONY BENCH, an app-level coding benchmark for evaluating LLM-based coding agents on OpenHarmony ArkTS applications. Unlike function-level benchmarks, it evaluates…
cs.SI2024
Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradation
Meng Qin, Chaorui Zhang, Yu Gao +2
Community detection (CD) is a classic graph inference task that partitions nodes of a graph into densely connected groups. While many CD methods have been proposed with either impr…
cs.SI2023
RaftGP: Random Fast Graph Partitioning
Yu Gao, Meng Qin, Yibin Ding +6
Graph partitioning (GP), a.k.a. community detection, is a classic problem that divides the node set of a graph into densely-connected blocks. Following prior work on the IEEE HPEC…