456 search results - page 49 / 92 » On Routing in Distributed Hash Tables |
HOTOS
2007
IEEE
14 years 2 months ago
2007
IEEE
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 ...
PVLDB
2008
13 years 10 months ago
2008
In this paper, we address data reconciliation in peer-to-peer (P2P) collaborative applications. We propose P2P-LTR (Logging and Timestamping for Reconciliation) which provides P2P...
TGC
2010
Springer
13 years 8 months ago
2010
Springer
Car sharing and car pooling have proven to be an effective solution to reduce the amount of running vehicles by increasing the number of passengers per car amongst medium/big commu...
PPOPP
2011
ACM
13 years 1 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...