We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Touchpad devices are widely used but lacking in pointing efficiency. The TouchGrid, an instance of what we term cell cursors, replaces moving the cursor through dragging the finger...
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
: We propose a novel algorithm to register multiple 3D point sets within a common reference frame simultaneously. Our approach performs an explicit optimisation on the manifold of ...
Shankar Krishnan, Pei Yean Lee, John B. Moore, Sur...