In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Abstract— In cellular systems a large reuse distance reduces cochannel interference while a small reuse distance increases bandwidth allocated to each cell. The optimal reuse dis...
Design is a ubiquitous activity. The complexity of design problems requires communities rather than individuals to address, frame, and solve them. These design communities have to...