Sciweavers

1763 search results - page 33 / 353
» Dependent random choice
Sort
View
WSC
2000
13 years 10 months ago
Generating "dependent" quasi-random numbers
Under certain conditions on the integrand, quasi-Monte Carlo methods for estimating integrals (expectations) converge faster asymptotically than Monte Carlo methods. Motivated by ...
Shane G. Henderson, Belinda A. Chiera, Roger M. Co...
RSA
2008
84views more  RSA 2008»
13 years 8 months ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
CPC
2006
93views more  CPC 2006»
13 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
RSA
2010
104views more  RSA 2010»
13 years 7 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
TOG
2008
103views more  TOG 2008»
13 years 9 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...