Sciweavers

1862 search results - page 129 / 373
» Constrained pattern matching
Sort
View
80
Voted
ICB
2009
Springer
107views Biometrics» more  ICB 2009»
15 years 7 months ago
Enhancement and Registration Schemes for Matching Conjunctival Vasculature
Ocular biometrics has made significant strides over the past decade primarily due to the rapid advances in iris recognition. Recent literature has investigated the possibility of ...
Simona Crihalmeanu, Arun Ross, Reza Derakhshani
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 7 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
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...
Kimmo Fredriksson, Fedor Nikitin
91
Voted
IJCNLP
2004
Springer
15 years 6 months ago
Improving Noun Phrase Coreference Resolution by Matching Strings
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 ...
Xiaofeng Yang, Guodong Zhou, Jian Su, Chew Lim Tan
107
Voted
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 5 months ago
A New Indexing Method for Approximate String Matching
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...
Gonzalo Navarro, Ricardo A. Baeza-Yates
112
Voted
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 2 months ago
On-Line Approximate String Matching with Bounded Errors
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...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha