57 search results - page 2 / 12 » N Degrees of Separation: Multi-Dimensional Separation of Con... |
IPL
2002
13 years 5 months ago
2002
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...
LATIN
2010
Springer
14 years 5 days ago
2010
Springer
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...
CORR
2010
Springer
2010
Springer
Binary is Good: A Binary Inference Framework for Primary User Separation in Cognitive Radio Networks
13 years 2 months ago
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...