2269 search results - page 331 / 454 » Query Incentive Networks |
130
click to vote
AINA
2007
IEEE
15 years 11 months ago
2007
IEEE
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
129
click to vote
LCN
2007
IEEE
15 years 11 months ago
2007
IEEE
— In order to be part of a peer-to-peer (P2P) file sharing network a host must be fully powered-on all of the time. In addition to providing a user interface, a P2P host handles ...
135
click to vote
HPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
159
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This te...
135
click to vote
IMC
2005
ACM
15 years 10 months ago
2005
ACM
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...