We develop and analyze a space time coded cooperative diversity protocol that achieves improved quality of service for mobile users in the downlink of small cells. The protocol, c...
Salam Akoum, Marie Zwingelstein-Colin, Robert W. H...
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...