Sciweavers

403 search results - page 80 / 81
» Bits through ARQs
Sort
View
TIT
2010
111views Education» more  TIT 2010»
13 years 22 days ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
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...
Adam Kirsch, Eleni Drinea
JOC
2011
94views more  JOC 2011»
12 years 9 months ago
Mutual Information Analysis: a Comprehensive Study
Mutual Information Analysis is a generic side-channel distinguisher that has been introduced at CHES 2008. It aims to allow successful attacks requiring minimum assumptions and kno...
Lejla Batina, Benedikt Gierlichs, Emmanuel Prouff,...
SIGMETRICS
2011
ACM
140views Hardware» more  SIGMETRICS 2011»
12 years 8 months ago
On the stability and optimality of universal swarms
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
Xia Zhou, Stratis Ioannidis, Laurent Massouli&eacu...
CCS
2011
ACM
12 years 6 months ago
Forensic investigation of the OneSwarm anonymous filesharing system
OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate se...
Swagatika Prusty, Brian Neil Levine, Marc Liberato...
HIPEAC
2011
Springer
12 years 5 months ago
Decoupled zero-compressed memory
For each computer system generation, there are always applications or workloads for which the main memory size is the major limitation. On the other hand, in many cases, one could...
Julien Dusser, André Seznec