14 search results - page 2 / 3 » Randomized Language Models via Perfect Hash Functions |
EMNLP
2009
13 years 2 months ago
2009
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
PKC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
EMNLP
2010
13 years 2 months ago
2010
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...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
JMLR
2012
11 years 7 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...