1997 search results - page 11 / 400 » On the convergence of Hill's method |
AI
2011
Springer
13 years 1 days ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
LSSC
2001
Springer
14 years 26 days ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
PRL
2007
13 years 8 months ago
2007
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
ALT
2004
Springer
14 years 5 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...