1401 search results - page 32 / 281 » Randomness in Interactive Proofs |
126
click to vote
SIAMIS
2010
14 years 4 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
74
Voted
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
MICCAI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...