Sciweavers

69 search results - page 9 / 14
» The Ackermann Award 2008
Sort
View
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
14 years 1 months ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
ELPUB
2008
ACM
13 years 9 months ago
Exploration and Evaluation of Citation Networks
This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into ac...
Karel Jezek, Dalibor Fiala, Josef Steinberger
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 7 months ago
Compound Multiple Access Channels with Partial Cooperation
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
Osvaldo Simeone, Deniz Gündüz, H. Vincen...
SIGCSE
2009
ACM
213views Education» more  SIGCSE 2009»
14 years 8 months ago
Engaging middle school teachers and students with alice in a diverse set of subjects
This paper describes the integration of the Alice 3D virtual worlds environment into a diverse set of subjects in middle school, including the development of tutorials, example wo...
Susan H. Rodger, Jenna Hayes, Gaetjens Lezin, Henr...
TIT
2008
110views more  TIT 2008»
13 years 7 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra