266 search results - page 32 / 54 » On the variance of random polygons |
149
click to vote
TCS
2010
15 years 24 days ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
124
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper consider the problem of how to evaluate the efficiency of a 3D continuous functional HRTF model in representing measured data. The proposed method is based on Karhunen...
172
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
149
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
154
click to vote
CCE
2004
15 years 6 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...