Sciweavers

608 search results - page 15 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Dynamic programming algorithm for rate-distortion optimized media streaming
We propose a dynamic programming algorithm for finding optimal transmission policies for a single packet in ratedistortion optimized media streaming. The algorithm relies on an op...
Jean Cardinal, Martin Röder, Raouf Hamzaoui
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 1 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
WSC
2007
13 years 10 months ago
Analysis and generation of random vectors with copulas
Copulas are used in finance and insurance for modeling stochastic dependency. They comprehend the entire dependence structure, not only the correlations. Here they are estimated ...
Johann Christoph Strelen, Feras Nassaj
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
13 years 9 months ago
Fault-tolerant facility location
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
Chaitanya Swamy, David B. Shmoys