170 search results - page 15 / 34 » On computational properties of chains of recurrences |
PR
2006
13 years 8 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
SAC
2011
ACM
12 years 11 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
A computational composite is a material in which computations contribute to the properties of the material through their capability to control transitions between states in the oth...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...