Opportunistic activity and context recognition systems do not presume a static sensor infrastructure that is defined at the design time of a system. They also do not have a fixed ...
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
It is widely recognized that inertial sensors, in particular gyroscopes, can improve the latency and accuracy of orientation tracking by fusing the inertial measurements with data...
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...