33 search results - page 1 / 7 » Simple deterministic wildcard matching |
IPL
2007
14 years 11 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
109
click to vote
JUCS
2010
14 years 10 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Traditional adaptive filtering systems learn the user’s interests in a rather simple way – words from relevant documents are favored in the query model, while words from irre...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...