1401 search results - page 139 / 281 » Randomness in Interactive Proofs |
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
AOSE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Governance means that specifications are enforced dynamically at application runtime. Governance framework is a technique to design and implement an extensible interactio...
BMCBI
2008
14 years 10 months ago
2008
Background: MicroRNAs (miRNAs) are a set of small non-coding RNAs serving as important negative gene regulators. In animals, miRNAs turn down protein translation by binding to the...
EUROCRYPT
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
RANDOM
1997
Springer
15 years 2 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...