— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use one se...