Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
— Battery capacity of mobile terminals and radio bandwidth are both limited and precious resources in wireless networks. In this paper, we present a thorough performance study of...
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
This paper is based on our exploratory study of a South Indian village in Chamrajanagar district of Karnataka. The study was to understand the rural communication environment and ...