310 search results - page 51 / 62 » Randomized Binary Search Trees |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
ICTAI
2010
IEEE
13 years 7 months ago
2010
IEEE
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
EJC
2006
13 years 10 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...