Sciweavers

1972 search results - page 196 / 395
» connection 2008
Sort
View
P2P
2008
IEEE
102views Communications» more  P2P 2008»
16 years 28 days ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
CISIS
2008
IEEE
15 years 8 months ago
Simplified Bluetooth Scatternet Formation Using Maximal Independent Sets
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...
Nejib Zaguia, Ivan Stojmenovic, Yassine Daadaa
EUROCRYPT
2008
Springer
15 years 8 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 7 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...