4007 search results - page 169 / 802 » Computation with imprecise probabilities |
131
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
111
click to vote
PE
2006
Springer
15 years 3 months ago
2006
Springer
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
129
Voted
TIT
2008
15 years 3 months ago
2008
Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability...
120
Voted
COLING
2002
15 years 3 months ago
2002
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
105
Voted
TIT
2002
15 years 3 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...