Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Compact Approximation of Lattice Functions with Applications to
  Large-Alphabet Text Search   We propose a very simple randomised data structure that stores an
approximation from above of a lattice-valued function. Computing the function
value requires a constant number of steps, and the error probability can be
balanced with space usage, much like in Bloom filters. The structure is
particularly well suited for functions that are bottom on most of their domain.
We then show how to use our methods to store in a compact way the bad-character
shift function for variants of the Boyer-Moore text search algorithms. As a
result, we obtain practical implementations of these algorithms that can be
used with large alphabets, such as Unicode collation elements, with a small
setup time. The ideas described in this paper have been implemented as free
software under the GNU General Public License within the MG4J project
(http://mg4j.dsi.unimi.it/).

21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat