306 search results - page 6 / 62 » Parameterized matching with mismatches |
CPM
2006
Springer
13 years 11 months ago
2006
Springer
IPL
2008
13 years 8 months ago
2008
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
DAC
1996
ACM
14 years 1 days ago
1996
ACM
The testability of basic DSP datapath structures using pseudorandom built-in self-test techniques is examined. The addition of variance mismatched signals is identified as a testi...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper we present a parameterized reduction technique for non-linear systems. Our approach combines an existing non-parameterized trajectory piecewise linear method for ...