Coordinated multi-point (CoMP) schemes have been widely studied in the recent years to limit the inter-cell interference and increase the rates achieved by the user equipments (UEs) at the cell edg
This paper discusses a hardware design for a dynamic data flow computer that has three basic features: (1) a Priority queue; (2) no FIFO queues, and (3) A Shortened data flow pipeline.
1. Introduction: Dataflow architecture is an alternative to Von Neumann architecture and is capable of efficiently exploiting massive amount of parallelism inherent in many types of computation.
In this paper, a distributed algorithm for dynamic frequency reuse scheme in OFDMA downlink cellular networks is proposed. Each cell is divided into two regions, namely, inner and outer regions.
In this paper, we propose a dynamic in-search data selection method to diagnose competing information automatically from speech data.
In this paper, we propose a dynamical in-search discriminative training approach for a large-scale HMM model in large vocabulary speech recognition.
The virtual synchrony model for group communication is a powerful paradigm for building distributed applications.
We introduce a class of optimization problems, called dynamic location problems, involving the processing of requests that occur sequentially at the nodes of a graph G.
We introduce a class of optimization problems, called dynamic location problems, involving the processing of requests that occur sequentially at the nodes of a graph G.
The problem of fast address lookup is crucial to routing and thus has received considerable attention.
