Temporal derivatives are computed by a wide variety of neural circuits, but the problem of performing this computation accurately has received little theoretical study. Here we sy...
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstines...
Ao Tang, Lachlan L. H. Andrew, Krister Jacobsson, ...
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...