A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
This paper describes a new framework for using natural selection to evolve Bayesian Networks for use in forecasting time series data. It extends current research by introducing a ...