1450 search results - page 28 / 290 » Juggling with Pattern Matching |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
JCSS
2010
13 years 6 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
WABI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
FUN
2010
Springer
14 years 14 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
A novel approach to pattern matching is presented, which reduces time complexity by two orders of magnitude compared to traditional approaches. The suggested approach uses an effi...