2127 search results - page 3 / 426 » Computing large matchings fast |
BMCBI
2006
13 years 7 months ago
2006
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
CPM
1998
Springer
13 years 11 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...