Sciweavers

13 search results - page 1 / 3
» Error-bounded probabilistic computations between MA and AM
Sort
View
JCSS
2006
63views more  JCSS 2006»
13 years 7 months ago
Error-bounded probabilistic computations between MA and AM
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
Elmar Böhler, Christian Glaßer, Daniel ...
CORR
1999
Springer
71views Education» more  CORR 1999»
13 years 7 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
IM
2007
13 years 7 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
ADBIS
1995
Springer
155views Database» more  ADBIS 1995»
13 years 11 months ago
The MaStA I/O Cost Model and its Validation Strategy
Crash recovery in database systems aims to provide an acceptable level of protection from failure at a given engineering cost. A large number of recovery mechanisms are known, and...
S. Scheuerl, Richard C. H. Connor, Ronald Morrison...
CCR
2008
94views more  CCR 2008»
13 years 7 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...