516 search results - page 13 / 104 » Sets of k-Independent Strings |
CPM
1995
Springer
13 years 11 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivit...
STRINGOLOGY
2008
13 years 9 months ago
2008
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
CAL
2008
13 years 7 months ago
2008
We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state grap...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...