2743 search results - page 285 / 549 » Minimization of an M-convex Function |
192
click to vote
TNN
2010
15 years 1 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
215
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
254
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
156
click to vote
CGI
2001
IEEE
15 years 10 months ago
2001
IEEE
We use relaxation to produce painted imagery from images and video. An energy function is first specified; we then search for a painting with minimal energy. The appeal of this st...
153
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...