Publications

We show that there is no $(loglog M)^{1-ve}$ approximation for the undirected congestion minimization problem unless $NP subseteq ZPTIME(n^{polylog~n})$, where $M$ is the size of the graph and $ve$

We show that there is no $log^{{1over 3}-ve} M$ approximation for the undirected Edge-Disjoint Paths problem unless $NP subseteq ZPTIME(n^{polylog~n})$, where $M$ is the size of the graph and $ve$

In the edge-disjoint paths problem with congestion (EDPwC), we are given a graph with n nodes, a set of terminal pairs and an integer c.

The hardnesses and elastic moduli of strained layer superlattices with 40 cycles and 200 cycles of 25 angstrom ZnTe grown on GaAs substrates by MOCVD are investigated using a nanoindenter.

More and more TVoIP services are emerging on the market using RTP to compensate for the dynamic routing. Interactive applications, however, still suffer from the network's long latency.

Since the publication of the first Special Issue on Digital Processing of the PROCEEDINGS OF THE IEEE in April 1975, there have been significant advances in the development of algorithms and their

In multimedia applications, the stringent requirements for balancing transmission capacity, flexible service provisioning and cost reduction lead the manufactures to provide highly integrated Syste

This paper analyzes how the distortion created by hardware impairments in a multiple-antenna base station affects the uplink spectral efficiency (SE), with focus on Massive MIMO.

Emerging new applications, such as Internet of Things (IoT), gigabit wireless connectivity, tactile internet, and many more are expected to impose new and diverse requirements on the design of the

Hardware growth and conversion in a working telephone switching office requires software programs integrated with manual procedures to bring new or updated equipment into a central office.