450 search results - page 38 / 90 » Satisfiability with Exponential Families |
TIT
2008
14 years 11 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
116
click to vote
KBSE
2010
IEEE
14 years 10 months ago
2010
IEEE
A Software Product Line (SPL) is a family of programs. Testing an SPL is a challenge because the number of programs to examine may be exponential in the number of features. Howeve...
SIAMCO
2010
14 years 6 months ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we present a novel technique for modeling the posterior probability estimates obtained from a neural network directly in the HMM framework using the Dirichlet Mixtu...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, the use of closed-form expressions is compared to the BIC approximation, with respect to speaker clustering. We first show that the particular BIC setting which is...