Sciweavers

336 search results - page 1 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
ENTCS
2007
65views more  ENTCS 2007»
13 years 4 months ago
Effective Randomness for Computable Probability Measures
Laurent Bienvenu, Wolfgang Merkle
CSR
2006
Springer
13 years 8 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
ICC
2008
IEEE
101views Communications» more  ICC 2008»
13 years 11 months ago
SINR Estimation in Random Beamforming with Noisy MIMO Channel Measurements
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
Roland Tresch, Maxime Guillaud
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
13 years 10 months ago
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Y...
WIOPT
2011
IEEE
12 years 8 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...