Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing pa...
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireles...
Alan A. Bertossi, Stephan Olariu, Maria Cristina P...
This paper proposes a fine granularity scalable (FGS) coding using cycle-based leaky prediction, in which the multiple leaky factors are used to yield enhancement layer prediction ...
Xiangyang Ji, Yanyan Zheng, Debin Zhao, Feng Wu, W...
Data stream management systems need to control their resources adaptively since stream characteristics and query workload may vary over time. In this paper we investigate an approa...