148 search results - page 11 / 30 » Linear reductions of maximum matching |
186
click to vote
CPM
1994
Springer
15 years 10 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
158
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
140
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is ...
156
click to vote
IMA
2001
Springer
15 years 10 months ago
2001
Springer
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
143
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- This paper describes the stochastic model order reduction algorithm via stochastic Hermite Polynomials from the practical implementation perspective. Comparing with exis...