Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
We study returns in dynamical systems: when a set of points, initially populating a prescribed region, swarms around phase space according to a deterministic rule of motion, we sa...
The Dynamic Host Configuration Protocol (DHCP) is used to dynamically allocate address space to hosts on a local area network. Despite its widespread usage, few studies exist on ...
Manas Khadilkar, Nick Feamster, Matt Sanders, Russ...