Open Access · CC BY 4.0
G-MORDA: Graph-guided Compression with Locally Distinct Selection for Efficient VideoLLM Reasoning
Procedia Computer Science · 2026 · 292 · 1025-1034
DOI: 10.1016/j.procs.2026.09.177 ↗Kurz gefasst
Fachartikel in der Zeitschrift Procedia Computer Science, 2026. Verfasst von Thai Nguyen und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NAFOSTED.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- NAFOSTED
Zitieren
APA
Nguyen, T., Tran, T. L., & Le, T. (2026). G-MORDA: Graph-guided Compression with Locally Distinct Selection for Efficient VideoLLM Reasoning. Procedia Computer Science, 292, 1025-1034. https://doi.org/10.1016/j.procs.2026.09.177
Vancouver
Nguyen T, Tran TL, Le T. G-MORDA: Graph-guided Compression with Locally Distinct Selection for Efficient VideoLLM Reasoning. Procedia Computer Science. 2026;292:1025-1034. doi:10.1016/j.procs.2026.09.177
BibTeX
@article{Nguyen2026,
author = {Nguyen, Thai and Tran, Thanh Long and Le, Thanh},
title = {G-MORDA: Graph-guided Compression with Locally Distinct Selection for Efficient VideoLLM Reasoning},
journal = {Procedia Computer Science},
year = {2026},
volume = {292},
pages = {1025--1034},
doi = {10.1016/j.procs.2026.09.177}
}
EUVIMED