1513 search results - page 100 / 303 » Cryptographic Pattern Matching |
103
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
105
click to vote
IJCNLP
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we ...
118
Voted
CPM
1999
Springer
15 years 6 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
121
Voted
CPM
2008
Springer
15 years 4 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
126
Voted
FGR
2008
IEEE
15 years 2 months ago
2008
IEEE
This paper presents a face verification framework for fusing matching scores that measure similarities of local facial features. The framework is aimed to handle an openset verifi...