Sciweavers

56 search results - page 2 / 12
» (Not) Bounding the True Error
Sort
View
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 5 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
13 years 11 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 5 months ago
Distance distribution of binary codes and the error probability of decoding
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
Alexander Barg, Andrew McGregor
CORR
1999
Springer
71views Education» more  CORR 1999»
13 years 5 months ago
New Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
Marcus Hutter
ICC
2007
IEEE
162views Communications» more  ICC 2007»
13 years 11 months ago
Effect of Non-Linearity on the Performance of a MIMO Zero-Forcing Receiver with Channel Estimation Errors
— Non-linear amplitude distortion may be the key impairment in some practical multiple-input multipleoutput (MIMO) communications systems. However, there are only a few past inve...
Edward K. S. Au, Wai Ho Mow