We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
— In this paper, we develop low-complexity iterative channel estimation techniques for emerging IDMA systems. The channel estimators make use of pilots as well as soft decoded da...
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...