485 search results - page 48 / 97 » Iterative Bounding LAO |
94
Voted
SIAMCO
2002
15 years 7 days 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...
97
Voted
APLAS
2005
ACM
15 years 6 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
84
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
101
Voted
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...