Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
Chandra Chekuri, F. Bruce Shepherd, Christophe Wei...
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...
In this pair of papers (Part I and Part II in this issue), we investigate the issue of power control and subcarrier assignment in a sectorized two-cell downlink OFDMA system impair...
Nassar Ksairi, Pascal Bianchi, Philippe Ciblat, Wa...
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...