126 search results - page 9 / 26 » Storing a Compressed Function with Constant Time Access |
90
Voted
IWMM
2007
Springer
15 years 3 months ago
2007
Springer
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
90
Voted
ICIC
2009
Springer
15 years 4 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
JSAC
2008
14 years 9 months ago
2008
Abstract--In a downlink Orthogonal Frequency Division Multiple Access (OFDMA) system, optimally allocating sub-channels across mobile users can require excessive feedback of channe...