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...
We construct a theory-based numerical method for starting the continuation of homoclinic tangencies near 1 : 1 resonances, for systems with arbitrary dimension 2. The core of the ...
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
In this paper, we extend the QMR-DT probabilistic model for the domain of internal medicine to include decisions about treatments. In addition, we describe how we can use the comp...