188 search results - page 17 / 38 » An Algorithm for Solving Systems of Linear Diophantine Equat... |
AUTOMATICA
2006
13 years 7 months ago
2006
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
SIAMSC
2010
13 years 6 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
SIAMJO
2008
13 years 7 months ago
2008
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
IPPS
2000
IEEE
14 years 23 hour ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...