1319 search results - page 82 / 264 » Recursive Random Fields |
97
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...
125
Voted
MOC
1998
15 years 2 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
109
click to vote
APJOR
2010
15 years 21 days ago
2010
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
120
click to vote
CPC
2006
15 years 2 months ago
2006
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...
124
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...