5331 search results - page 649 / 1067 » Algebraic Methods for Optimization Problems |
184
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
173
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
232
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
232
click to vote
CVPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
178
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
This paper proposes a method to construct an adaptive agent that is universal with respect to a given class of experts, where each expert is designed specifically for a particular...