Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Fundamenta Informaticae

1 2012

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: birthday problem

Sortuj według:

Ogranicz wyniki do:

Boys-and-girls Birthdays and Hadamard Products

Bodini O., Gardy D., Roussel O.

Fundamenta Informaticae

2012

Vol. 117, nr 1-4

85-101

Boltzmann models from statistical physics, combined with methods from analytic combinatorics, give rise to efficient and easy-to-write algorithms for the random generation of combinatorial objects. This paper proposes to extend Boltzmann generators to a new field of applications by uniformly sampling a Hadamard product. Under an abstract real-arithmetic computationmodel, our algorithm achieves approximate-size sampling in expected time O(n.n) or O(n σ) depending on the objects considered, with . the standard deviation of smallest order for the component object sizes. This makes it possible to generate random objects of large size on a standard computer. The analysis heavily relies on a variant of the so-called birthday paradox, which can be modelled as an occupancy urn problem.