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...
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...