Sciweavers

608 search results - page 33 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
103
Voted
WSC
2007
15 years 2 months ago
A method for fast generation of bivariate Poisson random vectors
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
Kaeyoung Shin, Raghu Pasupathy
ICALP
2004
Springer
15 years 5 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
102
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 2 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 6 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
94
Voted
VTC
2006
IEEE
15 years 6 months ago
Semi-Analytical Model of Interference in CDMA-TDD Using Random Time Slot Hopping
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
Ellina Foutekova, Christine Evers, Harald Haas