Sciweavers

18 search results - page 1 / 4
» The infamous upper tail
Sort
View
RSA
2002
71views more  RSA 2002»
13 years 4 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
13 years 5 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
EUROPAR
2004
Springer
13 years 10 months ago
Architecture-Independent Meta-optimization by Aggressive Tail Splitting
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
Michael Rock, Andreas Koch
PVLDB
2010
104views more  PVLDB 2010»
13 years 3 months ago
MCDB-R: Risk Analysis in the Database
Enterprises often need to assess and manage the risk arising from uncertainty in their data. Such uncertainty is typically modeled as a probability distribution over the uncertain...
Peter J. Haas, Christopher M. Jermaine, Subi Arumu...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 5 days ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...