Bounds are derived on the noncoherent capacity of a very general class of multiple-input multiple-output fading channels that are selective in time and frequency as well as correla...
Ulrich G. Schuster, Giuseppe Durisi, Helmut Bö...
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large ...
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
We present a multi-dimensional generalization of the Szemer´edi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes i...
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...