306 search results - page 2 / 62 » Parameterized matching with mismatches |
ISCAS
2008
IEEE
14 years 6 days ago
2008
IEEE
—This paper shows how the relative size of components can be used to increase matching performance – saving orders of magnitude in component area. The relative size information...
ISCAS
2007
IEEE
14 years 2 days ago
2007
IEEE
—Component tolerances and mismatches due to process variations severely degrade the performance of bandgap reference (BGR) circuits. In this paper, we describe the design of a BG...
IPL
2008
13 years 5 months ago
2008
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
CPM
2005
Springer
13 years 11 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
NIPS
2008
13 years 7 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...