3875 search results - page 270 / 775 » Approximation algorithms for the 0-extension problem |
154
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
155
click to vote
CPAIOR
2007
Springer
16 years 27 days ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
209
click to vote
ICPR
2006
IEEE
2006
IEEE
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
16 years 23 days ago
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
177
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
148
click to vote
ENDM
2008
15 years 6 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...