We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
Patrick Coleman, Karan Singh, Leon Barrett, Nisha ...
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....