The K-th nearest neighbor random walk on a homogeneous Poisson point process visits finitely many points if and only if K has bounded support, with exponential decay in visits and path length, plus a polynomial-tail counterexample.
Genesis: A generative and universal physics engine for robotics and beyond
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
VUDA enables spatial sharing between CUDA and Vulkan on GPUs via channel redirection and page-table grafting, achieving up to 85% higher throughput than temporal baselines in embodied AI tasks.
citing papers explorer
-
The $K$-th nearest neighbor random walk on a Poisson point process gets trapped
The K-th nearest neighbor random walk on a homogeneous Poisson point process visits finitely many points if and only if K has bounded support, with exponential decay in visits and path length, plus a polynomial-tail counterexample.
-
VUDA: Breaking CUDA-Vulkan Isolation for Spatial Sharing of Compute and Graphics on the Same GPU
VUDA enables spatial sharing between CUDA and Vulkan on GPUs via channel redirection and page-table grafting, achieving up to 85% higher throughput than temporal baselines in embodied AI tasks.