Sciweavers

910 search results - page 58 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
AIRS
2004
Springer
15 years 8 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
IPMI
2005
Springer
15 years 8 months ago
Robust Active Appearance Model Matching
A novel robust active appearance model (AAM) matching algorithm is presented. The method consists of two main stages. First, initial residuals are clustered by a non parametric mea...
Reinhard Beichel, Horst Bischof, Franz Leberl, Mil...
DIS
2006
Springer
15 years 6 months ago
A New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masay...
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 3 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
PAMI
2007
262views more  PAMI 2007»
15 years 2 months ago
An Efficient Multimodal 2D-3D Hybrid Approach to Automatic Face Recognition
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens