3049 search results - page 301 / 610 » On the Convergence of Bound Optimization Algorithms |
175
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
182
click to vote
DMIN
2007
15 years 8 months ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
170
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
188
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...