跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 09:06 — 2026-11-17 09:06(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.16212

SPEM: Scan-Prior Entropy Modeling for LiDAR Point Cloud Compression

Bojun Liu, Yangzhi Ma, Jie Li, Dong Liu, Li Li

原文摘要

LiDAR point clouds exhibit scan-induced spatial regularities that are informative for geometry compression. Existing scan-aware approaches often exploit these regularities by transforming coded geometry into spherical or beam-aligned coordinate systems. However, this couples acquisition priors with geometry representation, altering spatial partitioning and quantization, and potentially preventing exact recovery of the original Cartesian geometry. We argue that acquisition priors should guide probability modeling rather than dictate the coding representation. We propose SPEM, a Scan-Prior Entropy Modeling framework that exploits LiDAR scanning regularities within the entropy model without requiring coordinate transformation. We introduce a multi-frequency spherical rotary positional encoding that captures scan-aligned spatial relationships in both backbone self-attention and decoded-context retrieval. Building upon this encoding, we develop a decoded-memory autoregressive predictor that efficiently exploits previously decoded occupancy information through reusable key/value caches. Experiments demonstrate state-of-the-art performance in both lossy and lossless LiDAR geometry compression, highlighting the effectiveness of scan-prior modeling across different coordinate representations.

cs.CV

新论文 · v1arXiv:2611.15084

Parallel Spanning Forest and Biconnectivity for Well-Connected Graph in Sub-Logarithmic Time

Bojun Liu, S. Cliff Liu, Shuaibo Yang

原文摘要

We give a randomized ARBITRARY CRCW PRAM algorithm for computing a spanning forest of an \(n\)-vertex, \(m\)-edge graph. Let \(d\) be the maximum component diameter. With good probability, the algorithm runs in \(O(\log d+\log\log n)\) time using \(O(m+n)\) processors and outputs a rooted spanning forest of original edges with maximum depth \(2^{O(\log d+\log\log n)}\). For finding bridges, our algorithm identifies every bridge edge in \(O(\log d+\log\log n)\) time. For biconnectivity, it outputs all blocks in \(O(\log d+\log d'+\log\log n)\) time, where \(d'\) is the bi-diameter. All these problems are fundamental in graph algorithms with numerous applications. Our results improve the best previous time bounds parameterized by the number of vertices and diameter. Finally, we prove deterministic \(Ω(\log n/\log\log n)\) lower bounds for outputting a DFS Sequence, a weighted spanning forest, and an ear decomposition.

cs.DS