Sciweavers

30 search results - page 1 / 6
» On a Global Complexity Bound of the Levenberg-Marquardt Meth...
Sort
View
MP
2006
134views more  MP 2006»
13 years 5 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
CVPR
2010
IEEE
14 years 1 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
SIGGRAPH
1994
ACM
13 years 9 months ago
A clustering algorithm for radiosity in complex environments
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
Brian E. Smits, James Arvo, Donald P. Greenberg
NIPS
2008
13 years 6 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould