We present a novel approach to the problem of the indoor localization in wireless environments. The main contribution of this paper is four folds: (a) We show that, by projecting t...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
The inherent uncertainty associated with unstructured environments makes establishing a successful grasp difficult. Traditional approaches to this problem involve hands that are c...
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
Ashraf Al Daoud, Murat Alanyali, David Starobinski