2370 search results - page 203 / 474 » The Characterization of Data-Accumulating Algorithms |
120
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
236
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
157
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
131
click to vote
SARA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
GD
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...