19 search results - page 2 / 4 » Online Suffix Trees with Counts |
IDEAS
2008
IEEE
14 years 16 hour ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
IJFCS
2008
13 years 5 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
NIPS
2004
13 years 7 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
OPODIS
2004
13 years 7 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...