Sciweavers

3250 search results - page 210 / 650
» An Algorithm to Solve a Linear Program
Sort
View
206
Voted
CIVR
2007
Springer
169views Image Analysis» more  CIVR 2007»
16 years 19 days ago
Whitened LDA for face recognition
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
Vo Dinh Minh Nhat, Sungyoung Lee, Hee Yong Youn
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 4 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
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...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
PADL
2010
Springer
16 years 3 months ago
Automating Mathematical Program Transformations
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
Ashish Agarwal, Sooraj Bhat, Alexander Gray, Ignac...
221
Voted
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
15 years 12 months ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 11 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao