836 search results - page 98 / 168 » Online EM Algorithm for Latent Data Models |
CEC
2003
IEEE
15 years 6 months ago
2003
IEEE
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
111
click to vote
PKDD
2005
Springer
15 years 6 months ago
2005
Springer
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
133
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
107
click to vote
CVPR
1997
IEEE
15 years 4 months ago
1997
IEEE
Grouping based on common motion, or “common fate” provides a powerful cue for segmenting image sequences. Recently a number of algorithms have been developed that successfully...