Sciweavers

10 search results - page 1 / 2
» Gap-Free Samples of Geometric Random Variables
Sort
View
ALENEX
2004
92views Algorithms» more  ALENEX 2004»
13 years 6 months ago
Gap-Free Samples of Geometric Random Variables
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
Pawel Hitczenko, Arnold Knopfmacher
DM
2007
87views more  DM 2007»
13 years 5 months ago
Gaps in samples of geometric random variables
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
William M. Y. Goh, Pawel Hitczenko
INFOCOM
2011
IEEE
12 years 8 months ago
Modeling residual-geometric flow sampling
Abstract—Traffic monitoring and estimation of flow parameters in high speed routers have recently become challenging as the Internet grew in both scale and complexity. In this ...
Xiaoming Wang, Xiaoyong Li, Dmitri Loguinov
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 7 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
WSCG
2004
142views more  WSCG 2004»
13 years 6 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...