9626 search results - page 492 / 1926 » Invariant Based Programming |
185
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 6 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
208
click to vote
ENGL
2007
15 years 6 months ago
2007
—The benefits of collaborative manufacturing are widely recognized both by the industry and the academic world. However, the engagement of collaborative manufacturing for Small a...
174
click to vote
ANOR
2005
15 years 6 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
176
click to vote
ANOR
2005
15 years 6 months ago
2005
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
205
click to vote
TMI
2008
15 years 6 months ago
2008
This paper introduces a 2-D strain imaging technique based on minimizing a cost function using dynamic programming (DP). The cost function incorporates similarity of echo amplitude...