Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...
Abstract. Though some studies involving general micro-mobility exist, micromobility research concerning a mobile node (MN) moving between Mobile Anchor Points (MAP) is lacking. In ...
We describe an optimization strategy for minimizing total power consumption using dual threshold voltage (Vth) technology. Significant power savings are possible by simultaneous a...
David Nguyen, Abhijit Davare, Michael Orshansky, D...
We consider new optimization problems for transceivers with DFE receivers and linear precoders, which also use bit loading at the transmitter. First, we consider the MIMO QoS (qual...
Ching-Chih Weng, Chun-Yang Chen, P. P. Vaidyanatha...
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....