An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in t...
In this paper we present a methodology and set of tools which assist the construction of applications from components, by separating the issues of transmission policy from compone...
Scott M. Walker, Alan Dearle, Graham N. C. Kirby, ...
Middleware technologies, often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies imposed by the Middleware system...
Alan Dearle, Scott M. Walker, Stuart J. Norcross, ...