14 search results - page 1 / 3 » Randomized Language Models via Perfect Hash Functions |
ACL
2008
15 years 1 months ago
2008
We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their associated probabilities, backoff weights, or oth...
LREC
2010
15 years 1 months ago
2010
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...
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
95
Voted
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...