Sciweavers

92 search results - page 11 / 19
» Probabilistic Proof Systems - A Survey
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
IPL
2006
88views more  IPL 2006»
13 years 7 months ago
A note on the attractor-property of infinite-state Markov chains
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
ICALP
2011
Springer
12 years 11 months ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy
SOUPS
2006
ACM
14 years 1 months ago
Human selection of mnemonic phrase-based passwords
Textual passwords are often the only mechanism used to authenticate users of a networked system. Unfortunately, many passwords are easily guessed or cracked. In an attempt to stre...
Cynthia Kuo, Sasha Romanosky, Lorrie Faith Cranor
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 7 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...