126 search results - page 1 / 26 » Storing a Compressed Function with Constant Time Access |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
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...
ICMCS
1996
IEEE
13 years 9 months ago
1996
IEEE
The use of bandwidth smoothing techniques for the delivery of prerecorded compressed video has been shown to be an effective technique in reducing the network bandwidth requiremen...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...