Sciweavers

849 search results - page 107 / 170
» Completely Non-malleable Schemes
Sort
View
ICCAD
2004
IEEE
135views Hardware» more  ICCAD 2004»
14 years 7 months ago
Soft self-synchronising codes for self-calibrating communication
Self-calibrating designs are gaining momentum in both the computation and communication worlds. Instead of relying on the worst-case characterisation of design parameters, self-ca...
Frederic Worm, Paolo Ienne, Patrick Thiran
SC
2009
ACM
14 years 5 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 5 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
GLOBECOM
2009
IEEE
14 years 4 months ago
Impact of Social Networks on Delay Tolerant Routing
Abstract—Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low d...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
IPPS
2009
IEEE
14 years 4 months ago
Treat-before-trick : Free-riding prevention for BitTorrent-like peer-to-peer networks
In P2P file sharing systems, free-riders who use others’ resources without sharing their own cause system-wide performance degradation. Existing techniques to counter freerider...
Kyuyong Shin, Douglas S. Reeves, Injong Rhee