Sciweavers

746 search results - page 5 / 150
» Fast (Structured) Newton Computations
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Fast multiple instance learning via L1, 2 logistic regression
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
Zhouyu Fu, Antonio Robles-Kelly
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
13 years 2 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...
PPOPP
2012
ACM
12 years 3 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
ECCV
2010
Springer
13 years 11 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
JSC
2008
162views more  JSC 2008»
13 years 7 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...