The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
Motivated by the recent concept of Space-Time Shift Keying (STSK), we propose a novel cooperative STSK scheme, which is capable of achieving a flexible rate-diversity tradeoff, in ...
BitTorrent is today's most influential peer-to-peer system. Currently BitTorrent has two very different operating models: (1) public trackers, and (2) private trackers (also k...
This research applies ideas from argumentation theory in the context of semantic wikis, aiming to provide support for structured-large scale argumentation between human agents. The...