1982 search results - page 1 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
121
Voted
IPPS
1997
IEEE
15 years 4 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...
104
Voted
CCE
2004
15 years 29 days ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
95
Voted
IPPS
1998
IEEE
15 years 5 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 ...
134
Voted
JMLR
2010
14 years 8 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
115
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
Sequential importance sampling (SIS), also known as particle filtering, has drawn increasing attention recently due to its superior performance in nonlinear and non-Gaussian dynam...