5595 search results - page 369 / 1119 » Approximation Algorithms for Clustering Problems |
172
click to vote
WSC
2001
15 years 8 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
188
Voted
TREC
2008
15 years 8 months ago
2008
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
213
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
158
click to vote
CPAIOR
2007
Springer
16 years 28 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...
211
click to vote
ICPR
2006
IEEE
2006
IEEE
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
16 years 24 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...