We address the content distribution problem as a network information flow problem on a caching augmented graph for which we provide a linear programming (LP)-based information theoretical lower bou
Let points Ax, · · · , An in the plane represent n cities which require a communications network. Let N{i, j) denote the number of channels which the network must supply between and A}.
Universal compressed sensing algorithms recover a "structured" signal from its under-sampled linear measurements, without knowing its distribution.
In this paper, discriminative training is studied to improve the performance of our Pseudo 2D Hidden Markov Models (PHMM)- based text recognition.
Let E sub n denote the minimum number of edges in a graph that contains every tree with n edges.
It is known through simple first-order analysis that differential delay between the propagational modes in multimode optical fibers can be greatly reduced by grading the optical index of the core s
This paper present new algorithms for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding future requests.
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding future requests.
Multiuser decision-feedback detectors (DFDS) for direct-sequence code-division multiple access, based on the minimum mean-squared error (MMSE) performance criterion, are described.
The variable-capacitance parametric amplifier is of interest primarily because it shows promise of very low noise amplification.
