The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
We implemented a five-week family program called Family Quest where parents and children ages 9 to 13 played Quest Atlantis, a multiuser 3D educational computer game, at a local af...
Sinem Siyahhan, Sasha A. Barab, Michael P. Downton
In this contribution, the capacity-achieving input covariance matrices for coherent blockfading correlated MIMO Rician channels are determined. In contrast with the Rayleigh and u...