Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Abstract—This paper investigates pricing of Internet connectivity services in the context of a monopoly ISP selling broadband access to consumers. We first study the optimal com...
Prashanth Hande, Mung Chiang, A. Robert Calderbank...