This is a preview. Log in through your library . Abstract Sufficient dimension reduction is popular for reducing data dimensionality without stringent model assumptions. However, most existing methods ...
An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...
Elkies, Noam D., and Scott Duke Kominers. "Weighted Generating Functions for Type II Lattices and Codes." In Quadratic and Higher Degree Forms. Vol. 31, edited by Alladi Krishnaswami, Manjul Bhargava, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback