Sciweavers

1510 search results - page 11 / 302
» Upper Probabilities and Additivity
Sort
View
CSFW
2007
IEEE
14 years 4 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
AAAI
2008
14 years 4 days ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
STOC
1999
ACM
81views Algorithms» more  STOC 1999»
14 years 2 months ago
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
IPMU
2010
Springer
13 years 11 months ago
On Nonparametric Predictive Inference for Ordinal Data
Abstract. Nonparametric predictive inference (NPI) is a powerful frequentist statistical framework based only on an exchangeability assumption for future and past observations, mad...
Frank P. A. Coolen, Pauline Coolen-Schrijner, Taha...
AML
2006
106views more  AML 2006»
13 years 10 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov