5084 search results - page 961 / 1017 » Proving Possibility Properties |
DCC
2004
IEEE
16 years 5 days ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
TCC
2010
Springer
15 years 9 months ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to â€...
98
Voted
RECOMB
2010
Springer
15 years 7 months ago
2010
Springer
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...
95
Voted
LCTRTS
2010
Springer
15 years 7 months ago
2010
Springer
We describe the extension of a reactive programming language with a behavioral contract construct. It is dedicated to the programming of reactive control of applications in embedd...
100
Voted
CCS
2009
ACM
15 years 7 months ago
2009
ACM
Although modern communications services are susceptible to third-party eavesdropping via a wide range of possible techniques, law enforcement agencies in the US and other countrie...