266 search results - page 19 / 54 » On the variance of random polygons |
115
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
ISPDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
NIPS
2008
15 years 1 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
89
Voted
ICA
2007
Springer
15 years 3 months ago
2007
Springer
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
121
click to vote
MOC
2010
14 years 6 months ago
2010
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...