2703 search results - page 185 / 541 » Working Class Hero |
188
click to vote
TIT
2010
14 years 11 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
138
Voted
SIGMETRICS
1998
ACM
15 years 8 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
165
click to vote
DBPL
1997
Springer
15 years 8 months ago
1997
Springer
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
148
click to vote
CSFW
2009
IEEE
15 years 8 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
145
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...