Consider the multiple-input multiple-output (MIMO) interfering broadcast channel whereby multiple base stations in a cellular network simultaneously transmit signals to a group of users in their ow
We present a solution to the "Privacy versus Personalization" dilemma, that enables the end-user to avail of collaborative personalization services without disclosing sensitive information to the c
An M/G/1 Queue With a Hybrid Discipline By B. T.
An N-channel BICFET has been fabricated in GaAs/AlGaAs MBE grown material, with the charge sheet situated in the wide band gap semiconductor.
An n-channel BICFET is demonstrated for the first time in the InGaAs/InAlGaAs/InAlAs Material System, achieving a current gain in a large area device of greater than 900.
The fastest generally recognized algorithms for computing the reliability of consecutive-k-out-of-n: F systems require O(n) time, for both the linear and circular systems.
We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log(4/3) n) space. This improves the previous O(log(3/2) n) bound of Nisan et al. {[}1992].
In the combinatorial version of the generalized birthday problem, w 1's and n - w 0's are randomly arranged in either a line or a cycle; k sub m is defined to be the largest number of 1's appearing
In this paper, we bound the complexity of the major algorithms of 1-d compaction in graph solution and module assembly to be O(n sup 1.5 logn).
This paper presents the first technique for computing the eigenvalues of symmetric Toeplitz and Hankel matrices in O(n sup 2 log (n)) computations, as compared to O(n sup 3) computations, required
