| CORMEN, T. H. Personal communication, 1997. |
....this parameter space is both interesting and appropriate for EM computation. Once the expression for the general lower bounds reported by [2, 39, 6] is specialized for the subset of the parameter space that we consider, it becomes fully compatible with our results. This answers questions of Cormen [12] and Vitter [40] on the apparent contradictions between the results of [17] and the previously stated lower bounds. 2. We obtain new, simple, parallel EM algorithms for sorting, permutation, and matrix transpose with I O complexity O( N pDB ) 3. We obtain parallel EM algorithms with I O ....
Cormen, T. H. Personal communication, 1997.
....this parameter space is both interesting and appropriate for EM computation. Once the expression for the general lower bounds reported by [1, 26, 3] is specialized for the subset of the parameter space that we consider, it becomes fully compatible with our results. This answers questions of Cormen [7] and Vitter [27] on the apparent contradictions between the results of [11] and the previously stated lower bounds. 2. We obtain new, simple, parallel EM algorithms for sorting, permutation, and matrix transpose with I O complexity O( N pDB ) 3. We obtain parallel EM algorithms with I O ....
CORMEN, T. H. Personal communication, 1997.
No context found.
CORMEN, T. H. Personal communication, 1997.
No context found.
CORMEN, T. H. Personal communication, 1997.
No context found.
CORMEN, T. H. Personal communication, 1997.
No context found.
T. H. Cormen. Personal communication, 1997.
No context found.
CORMEN, T. H. Personal communication, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC