Sciweavers

608 search results - page 22 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
WSC
2008
13 years 10 months ago
A plug-in-based architecture for random number generation in simulation systems
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...
Roland Ewald, Johannes Rossel, Jan Himmelspach, Ad...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 10 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
ICA
2007
Springer
14 years 1 months ago
Modeling and Estimation of Dependent Subspaces with Non-radially Symmetric and Skewed Densities
We extend the Gaussian scale mixture model of dependent subspace source densities to include non-radially symmetric densities using Generalized Gaussian random variables linked by ...
Jason A. Palmer, Kenneth Kreutz-Delgado, Bhaskar D...