Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
This paper discusses several distributed poweraware routing protocols in wireless ad-hoc networks (especially sensor networks). We seek to optimize the lifetime of the network. We...
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...