873 search results - page 19 / 175 » Rates of convergence for Quicksort |
165
click to vote
SIAMIS
2011
14 years 6 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
TNN
1998
14 years 11 months ago
1998
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
COMBINATORICS
2004
14 years 11 months ago
2004
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
NIPS
2008
15 years 1 months ago
2008
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
—The backpropagation algorithm is a very popular approach to learning in feed-forward multi-layer perceptron networks. However, in many scenarios the time required to adequately ...