1434 search results - page 17 / 287 » Distributed Computing with Imperfect Randomness |
ICDCSW
2009
IEEE
15 years 4 months ago
2009
IEEE
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
SPAA
1992
ACM
15 years 1 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...
ICDCSW
2006
IEEE
15 years 3 months ago
2006
IEEE
As an example of digital augmentation of a tiny object, a small cube-sized die is presented that perceives and records what face it rolls on. It is thus able to detect bias and co...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...