978 search results - page 77 / 196 » Knowledge, Probability, and Adversaries |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
108
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
UAI
1994
14 years 11 months ago
1994
In previous work [BGHK92, BGHK93], we have studied the random-worlds approach--a particular (and quite powerful) method for generating degrees of belief (i.e., subjective probabil...
ICVGIP
2004
14 years 11 months ago
2004
We present a new active active recognition scheme (using an uncalibrated camera) based on a new idea, appearancebased aspect graphs. The scheme is robust to background clutter, an...