4224 search results - page 748 / 845 » Reasoning about Choice |
235
Voted
POPL
2001
ACM
16 years 29 days ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
101
Voted
STOC
2005
ACM
16 years 29 days ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
STOC
2004
ACM
16 years 29 days ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
104
click to vote
PERCOM
2006
ACM
16 years 8 days ago
2006
ACM
Many information services in pervasive computing offer rich information, which is information that includes other types of information. For example, the information listed in a pe...
91
Voted
DCC
2007
IEEE
16 years 7 days ago
2007
IEEE
We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it...