We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
In this paper, a two-hop relay assisted cooperative Orthogonal Space-Time Block Codes (OSTBC) transmission scheme is considered for the downlink communication of a cellular system,...
Bo Niu, Mihaela C. Beluri, Zinan Lin, Prabhakar Ch...
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
This paper presents a preliminary knowledge based approach to Space-Time Adaptive Processing (STAP) for ground moving target indication from an airborne platform. The KB-processor...
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...