We show that for every x1, . . . , xn, y1, . . . , yn ∈ S1 there exists i ∈ {1, . . . , n} such that n k=1 d(xi, xk) ≤ n k=1 d(xi, yk), where S1 is the unit circle and d is ...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
Often, it is required to identify anomalous windows over a spatial region that reflect unusual rate of occurrence of a specific event of interest. A spatial scan statistic-based ap...
Active transportation – especially walking and cycling – is undergoing a surge in popularity in urban planning and transportation circles as a solution to the environmental and...
Human Identification using gait is a challenging computer vision task due to the dynamic motion of gait and the existence of various sources of variations such as viewpoint, walki...
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...