3573 search results - page 577 / 715 » Reasoning about Codata |
121
click to vote
STOC
2004
ACM
16 years 3 months 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...
125
click to vote
PERCOM
2006
ACM
16 years 2 months 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...
108
click to vote
DCC
2007
IEEE
16 years 2 months 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...
136
Voted
ICS
2010
Tsinghua U.
16 years 9 days ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
134
click to vote
SPAA
2009
ACM
16 years 2 days ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...