—We extend the existing network utility maximization (NUM) framework for wired networks to wireless sensor networks by formulating it in order to take into account interference a...
George Tichogiorgos, Kin K. Leung, Archan Misra, T...
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Advancements in network technologies dramatically increased management complexity. Cognitive networking was introduced to deal with this problem, by providing algorithms for autono...
Dzmitry Kliazovich, Neumar Malheiros, Nelson L. S....
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...