Sciweavers

1080 search results - page 101 / 216
» Distributed Hash Tables
Sort
View
COMPGEOM
2006
ACM
16 years 8 days ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
ASAP
2005
IEEE
96views Hardware» more  ASAP 2005»
15 years 12 months ago
On-Chip Lookup Tables for Fast Symmetric-Key Encryption
On public communication networks such as the Internet, data confidentiality can be provided by symmetric-key ciphers. One of the most common operations used in symmetric-key ciphe...
A. Murat Fiskiran, Ruby B. Lee
LREC
2010
155views Education» more  LREC 2010»
15 years 7 months ago
Efficient Minimal Perfect Hash Language Models
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
David Guthrie, Mark Hepple, Wei Liu
GLOBECOM
2007
IEEE
16 years 19 days ago
A Hash Function Scheme for Key Management in UMTS MBMS
—3GPP 33.246 proposes Key Management Mechanism (KMM) to distribute security keys for Universal Mobile Telecommunications System (UMTS) Multimedia Broadcast and Multicast Service ...
Shin-Ming Cheng, Wei-Ru Lai, Phone Lin
STACS
2012
Springer
14 years 1 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...