5785 search results - page 301 / 1157 » Approximability of Probability Distributions |
130
click to vote
SIAMCO
2002
15 years 4 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
177
click to vote
CORR
2012
Springer
14 years 14 days ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
154
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
138
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...
124
click to vote
TWC
2010
14 years 11 months ago
2010
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...