SPAA
1992
ACM
14 years 3 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— Cooperative diversiy is a promising technology for future wireless networks. In this paper, based on the moment generating function (MGF), we derive exact closed-form e...