Sciweavers

266 search results - page 4 / 54
» On the variance of random polygons
Sort
View
DMTCS
2010
126views Mathematics» more  DMTCS 2010»
14 years 6 months ago
Asymptotic variance of random symmetric digital search trees
Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas
COMPGEOM
1993
ACM
15 years 1 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
FOCM
2010
111views more  FOCM 2010»
14 years 6 months ago
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
Carlos Beltrán, Michael Shub
76
Voted
RSA
2010
89views more  RSA 2010»
14 years 8 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
WSC
2007
14 years 11 months ago
Feasibility study of variance reduction in the logistics composite model
The Logistics Composite Model (LCOM) is a stochastic, discrete-event simulation that relies on probabilities and random number generators to model scenarios in a maintenance unit ...
George P. Cole III, Alan W. Johnson, J. O. Miller