Sciweavers

403 search results - page 40 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
TIT
2002
78views more  TIT 2002»
13 years 9 months ago
Optimal placement of training for frequency-selective block-fading channels
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
Srihari Adireddy, Lang Tong, Harish Viswanathan
WSC
2004
13 years 11 months ago
Adaptive Control Variates
Adaptive Monte Carlo methods are specialized Monte Carlo simulation techniques where the methods are adaptively tuned as the simulation progresses. The primary focus of such techn...
Sujin Kim, Shane G. Henderson
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGGRAPH
2000
ACM
14 years 2 months ago
Plenoptic sampling
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, ...
QUESTA
2010
93views more  QUESTA 2010»
13 years 4 months ago
Towards an Erlang formula for multiclass networks
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
Matthieu Jonckheere, Jean Mairesse