In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
Frank Dellaert, Steven M. Seitz, Charles E. Thorpe...
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
In IEEE 802.11 based ad hoc networks, by simply manipulating the back-off timers and/or wait times prior to transmission, malicious nodes can cause a drastically reduced allocatio...
Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. ...