9209 search results - page 1712 / 1842 » Data Space Randomization |
129
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
149
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between ...
112
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Given a set of peers with overlapping interests where each peer wishes to keep track of new documents that are relevant to their interests, we propose a self-organizing peerto-pee...
124
Voted
FMN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Peer-to-Peer systems become popular applications but suffer from insufficient resource availability which is caused by free-riders and inefficient lookup algorithms. To a...
141
Voted
SIGMETRICS
2009
ACM
15 years 10 months ago
2009
ACM
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...