— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two step process where an initial coarse motion estimation is fo...
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...