2084 search results - page 230 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
108
Voted
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
77
Voted
DIALM
2008
ACM
14 years 12 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
107
click to vote
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
COLT
2010
Springer
14 years 8 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...