Sciweavers

33 search results - page 1 / 7
» Simple deterministic wildcard matching
Sort
View
IPL
2007
91views more  IPL 2007»
13 years 4 months ago
Simple deterministic wildcard matching
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...
Peter Clifford, Raphaël Clifford
JUCS
2010
161views more  JUCS 2010»
13 years 3 months ago
Evaluating Linear XPath Expressions by Pattern-Matching Automata
: 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...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
CIKM
2007
Springer
13 years 11 months ago
Generalizing from relevance feedback using named entity wildcards
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...
Abhimanyu Lad, Yiming Yang
STOC
2007
ACM
104views Algorithms» more  STOC 2007»
14 years 5 months ago
Simple deterministic approximation algorithms for counting matchings
Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 12 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
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...
Pawel Gawrychowski