The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Images typically contain smooth regions, which are easily compressed by linear transforms, and high activity regions (edges, textures), which are harder to compress. To compress t...
Patrice Y. Simard, Christopher J. C. Burges, David...
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...