339 search results - page 1 / 68 » Random Sampling Techniques in Parallel Computation |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
IPPS
1997
IEEE
13 years 8 months 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...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
ICRA
1995
IEEE
13 years 8 months ago
1995
IEEE
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...