185 search results - page 10 / 37 » Some extensions of score matching |
95
Voted
DCC
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
DDECS
2006
IEEE
15 years 5 months ago
2006
IEEE
- Extension of a BIST design algorithm is proposed in this paper. The method is based on a synthesis of a combinational block - the decoder, transforming pseudo-random code words i...
ENTCS
2008
14 years 11 months ago
2008
In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes barely tractable by t...
114
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
The previous work of the authors has shown that physiological
information on the face can be extracted from
thermal infrared imagery and can be used as a biometric.
Although, th...
114
click to vote
RECOMB
1998
Springer
15 years 4 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...