Sciweavers

122 search results - page 3 / 25
» Reducing the Storage Requirements of a Perfect Hash Function
Sort
View
ASIACRYPT
2003
Springer
13 years 11 months ago
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
Dwaine E. Clarke, Srinivas Devadas, Marten van Dij...
GLOBECOM
2007
IEEE
14 years 3 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
EMNLP
2010
13 years 3 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple
ICML
2010
IEEE
13 years 6 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 4 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang