873 search results - page 1 / 175 » Rates of convergence for Quicksort |
JAL
2002
13 years 5 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
CDC
2010
IEEE
13 years 12 days ago
2010
IEEE
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
CDC
2010
IEEE
13 years 12 days ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
MOC
2010
13 years 4 days ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...