The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...