719 search results - page 105 / 144 » Solving Sparse Linear Constraints |
MP
2007
14 years 10 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
108
click to vote
SCIA
2009
Springer
15 years 5 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
CGF
2007
14 years 11 months ago
2007
Laplacian coordinates as a local shape descriptor have been employed in mesh editing. As they are encoded in the global coordinate system, they need to be transformed locally to r...
ICASSP
2008
IEEE
15 years 5 months ago
2008
IEEE
A new design approach for an allpass transformed analysis-synthesis filter-bank (AS FB) with subsampling is proposed, which can be used for adaptive subband processing with non-u...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...