8728 search results - page 52 / 1746 » On Reduct Construction Algorithms |
121
click to vote
TIT
2008
15 years 3 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
IJBC
2010
14 years 10 months ago
2010
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 ...
STOC
1991
ACM
15 years 6 months ago
1991
ACM
We describe a new deterministic algorithm for the problem of constructing k-th
127
click to vote
CRYPTO
1993
Springer
15 years 7 months ago
1993
Springer
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...
110
click to vote
UAI
1990
15 years 4 months ago
1990
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...