Sciweavers

873 search results - page 66 / 175
» Rates of convergence for Quicksort
Sort
View
LSSC
2001
Springer
15 years 4 months ago
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
Aneta Karaivanova, Rayna Georgieva
TSP
2008
134views more  TSP 2008»
14 years 11 months ago
Computational Algorithms for Wavelet Identification of Nonlinearities in Hammerstein Systems With Random Inputs
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
Przemyslaw Sliwinski, Zygmunt Hasiewicz
MOR
2010
120views more  MOR 2010»
14 years 10 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
CVPR
2010
IEEE
15 years 8 months ago
Online-Batch Strongly Convex Multi Kernel Learning
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
Francesco Orabona, Jie Luo, Barbara Caputo
COLT
2004
Springer
15 years 5 months ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...