Sciweavers

1080 search results - page 80 / 216
» Distributed Hash Tables
Sort
View
ICIP
2008
IEEE
16 years 18 days ago
Rate-efficient visual correspondences using random projections
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
Chuohao Yeo, Parvez Ahammad, Kannan Ramchandran
ACNS
2007
Springer
91views Cryptology» more  ACNS 2007»
15 years 10 months ago
Efficient Content Authentication in Peer-to-Peer Networks
ed Abstract
Roberto Tamassia, Nikos Triandopoulos
INTR
2006
87views more  INTR 2006»
15 years 6 months ago
Agyaat: mutual anonymity over structured P2P networks
Purpose
Aameek Singh, Bugra Gedik, Ling Liu
IPPS
2008
IEEE
16 years 17 days ago
A hash-TLB approach for MMU virtualization in xen/IA64
Xiantao Zhang, Anthony X. F. Xu, Qi Li, David K. Y...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel