1110 search results - page 151 / 222 » New Approximation Results for Resource Replication Problems |
PKDD
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
SCALESPACE
2007
Springer
15 years 5 months ago
2007
Springer
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
SIAMSC
2008
14 years 11 months ago
2008
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
108
click to vote
KSEM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...