We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
A precoding strategy for multi-user spectrum sharing over an interference channel is proposed and analyzed from a game-theoretic perspective. The proposed strategy is based on fi...
This paper introduces MOCAS (Model Of Components for Adaptive Systems), a generic state-based component model which enables the self-adaptation of software components together wit...
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...