735 search results - page 115 / 147 » Randomization in Parallel Stringology |
PARELEC
2006
IEEE
14 years 2 months ago
2006
IEEE
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
SPAA
1997
ACM
14 years 21 days ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
DCOSS
2006
Springer
14 years 5 days ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
IPPS
1997
IEEE
14 years 2 days ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...