1089 search results - page 75 / 218 » Randomness and Reducibility |
3DIM
2001
IEEE
14 years 22 days ago
2001
IEEE
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
SIGMETRICS
2002
ACM
13 years 8 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
VTS
2003
IEEE
14 years 2 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
PODC
2009
ACM
14 years 1 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
SIGMOD
1998
ACM
14 years 1 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...