Sciweavers

343 search results - page 31 / 69
» Weighted distributed hash tables
Sort
View
HOTOS
2007
IEEE
14 years 2 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
MOBILITY
2009
ACM
14 years 5 months ago
Feasibility evaluation of a communication-oriented P2P system in mobile environments
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
Zhonghong Ou, Erkki Harjula, Otso Kassinen, Mika Y...
ICCV
2011
IEEE
12 years 11 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
DELOS
2004
14 years 9 days ago
Towards Collaborative Search in Digital Libraries Using Peer-to-Peer Technology
We consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peerto-peer (P2P) environment. Both digital libraries a...
Matthias Bender, Sebastian Michel, Christian Zimme...
OSDI
2004
ACM
14 years 11 months ago
Chain Replication for Supporting High Throughput and Availability
Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The approach is intended for supporting large-scale storage services that exhibit high t...
Robbert van Renesse, Fred B. Schneider